-
19On Provability Logics with Linearly Ordered ModalitiesStudia Logica 102 (3): 541-566. 2014.We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free frag…Read more
-
6The Dynamics of Epistemic Attitudes in Resource-Bounded AgentsStudia Logica 107 (3): 457-488. 2019.The paper presents a new logic for reasoning about the formation of beliefs through perception or through inference in non-omniscient resource-bounded agents. The logic distinguishes the concept of explicit belief from the concept of background knowledge. This distinction is reflected in its formal semantics and axiomatics: we use a non-standard semantics putting together a neighborhood semantics for explicit beliefs and relational semantics for background knowledge, and we have specific axioms …Read more
-
5Strong completeness of provability logic for ordinal spacesJournal of Symbolic Logic 82 (2): 608-628. 2017.
-
12Evidence and plausibility in neighborhood structuresAnnals of Pure and Applied Logic 165 (1): 106-133. 2014.The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in terms of this …Read more
-
3Hindman’s theorem in the hierarchy of choice principlesJournal of Mathematical Logic 24 (1). 2023.In the context of [Formula: see text], we analyze a version of Hindman’s finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various classical weak choice principles, thus precisely locating the strength of the statement as a weak form of the [Formula: see text].
-
26Complete Intuitionistic Temporal Logics for Topological DynamicsJournal of Symbolic Logic 87 (3): 995-1022. 2022.The language of linear temporal logic can be interpreted on the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${\sf ITL}^{\sf c}_{\Diamond \forall }$, recently shown to be decidable by Fernández-Duque. In this article we axiomatize this logic, some fragments, and prove completeness for several familiar spaces.
-
12Taming the ‘Elsewhere’: On Expressivity of Topological LanguagesReview of Symbolic Logic 17 (1): 144-153. 2024.In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the ‘elsewhere’, or ‘difference’, operator is more expressive than the ‘somewhere’ operator. In 2014, Kudinov and Shehtman asked whether the combination of closure and elsewhere becomes strictly more expressive when adding the Cantor derivative. In this paper we give an affirmative answer: in fact, the Cantor derivative alone can define properties of topological spaces not…Read more
-
7Finiteness classes arising from Ramsey-theoretic statements in set theory without choiceAnnals of Pure and Applied Logic 172 (6): 102961. 2021.
-
7Frame-validity Games and Lower Bounds on the Complexity of Modal AxiomsLogic Journal of the IGPL 30 (1): 155-185. 2022.We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.
-
6Non-deterministic semantics for dynamic topological logicAnnals of Pure and Applied Logic 157 (2-3): 110-121. 2009.Dynamic Topological Logic () is a combination of , under its topological interpretation, and the temporal logic interpreted over the natural numbers. is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples , where is a topological space, f a function on X and V a truth valuation assigning subsets of X to propositional variables. Our main result is that the set of valid formulas of over spaces with co…Read more