Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Igor Sedlár"'
Publikováno v:
Journal of Logic and Computation. 33:436-461
We study a version of public announcement logic with common knowledge based on the relevant logic $\textsf {R}$. Public announcements, as represented in our framework, are not necessarily truthful and accepted by all agents, nor is it assumed that be
Autor:
Igor Sedlár
Publikováno v:
Relational and Algebraic Methods in Computer Science ISBN: 9783031280825
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::083e764d827a2983d3e0d198981539cc
https://doi.org/10.1007/978-3-031-28083-2_13
https://doi.org/10.1007/978-3-031-28083-2_13
Autor:
Vít Punčochář, Igor Sedlár
Publikováno v:
Journal of Logic and Computation. 31:1820-1844
In this paper, we study the epistemic extensions of distributive substructural inquisitive logics. Substructural inquisitive logics are logics of questions based on substructural logics of declarative sentences. They generalize basic inquisitive logi
Autor:
Vít Punčochář, Igor Sedlár
Publikováno v:
Journal of Logic, Language and Information. 30:91-116
This paper combines propositional dynamic logic ( $${\textsf {PDL}}$$ ) with propositional inquisitive logic ( $$\textsf {InqB}$$ ). The result of this combination is a logical system $$\textsf {InqPDL}$$ that conservatively extends both $${\textsf {
Autor:
Igor Sedlár, Andrew Tedder
Publikováno v:
Studia Logica. 109:447-470
We study an expansion of the Distributive Non-associative Lambek Calculus with conjugates of the Lambek product operator and residuals of those conjugates. The resulting logic is well-motivated, under-investigated and difficult to tackle. We prove co
Autor:
Johann Joubert Wannenburg, Igor Sedlár
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783031152979
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fcf9820b51e54105882b281c51cf668
https://doi.org/10.1007/978-3-031-15298-6_14
https://doi.org/10.1007/978-3-031-15298-6_14
Autor:
Igor Sedlár
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783030930998
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6df958a7fc53a308a752462694a338d
https://doi.org/10.1007/978-3-030-93100-1_19
https://doi.org/10.1007/978-3-030-93100-1_19
Autor:
Igor Sedlár
Publikováno v:
KR
Propositional Dynamic Logic, PDL, is a well known modal logic formalizing reasoning about complex actions. We study many-valued generalizations of PDL based on relational models where satisfaction of formulas in states and accessibility between state
Autor:
Igor Sedlár, Vít Punčochář
Publikováno v:
Logic Journal of the IGPL. 27:522-542
We provide a complete binary implicational axiomatization of the positive fragment of propositional dynamic logic (PDL). The intended application of this result are completeness proofs for non-classical extensions of positive PDL. Two examples are di
Autor:
Igor Sedlár
Publikováno v:
Synthese. 198:933-956
We introduce a general representation of unary hyperintensional modalities and study various hyperintensional modal logics based on the representation. It is shown that the major approaches to hyperintensionality known from the literature, that is st