Related papers: Failure of the Blok-Esakia Theorem in the monadic …
Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…
We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in the standard…
We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable.…
A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…
We prove that there is a factor of the Muchnik lattice that captures intuitionistic propositional logic. This complements a now classic result of Skvortsova for the Medvedev lattice.
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…
We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…
In this paper, we establish a criterion for an overconvergent isocrystal on a smooth variety over a field of characteristic $p>0$ to extend logarithmically to its smooth compactification whose complement is a strict normal crossing divisor.…
We prove a generalization of Tukia's ('85) isomorphism theorem which states that isomorphisms between geometrically finite groups extend equivariantly to the boundary. Tukia worked in the setting of real hyperbolic spaces of finite…
The degree of Kripke-incompleteness of a logic $L$ in some lattice $\mathcal{L}$ of logics is the cardinality of logics in $\mathcal{L}$ which share the same class of Kripke-frames with $L$. A celebrated result on Kripke-incompleteness is…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent…
Tremendous research effort has been dedicated over the years to thoroughly investigate non-monotonic reasoning. With the abundance of non-monotonic logical formalisms, a unified theory that enables comparing the different approaches is much…
Poole has shown that nonmonotonic logics do not handle the lottery paradox correctly. In this paper we will show that Pollock's theory of defeasible reasoning fails for the same reason: defeasible reasoning is incompatible with the…
In this article we characterize the equivalent algebraic semantics for the one-variable monadic fragment of the first-order logic ${\cal G} \forall_{\sim}$ defined by F. Esteva, L. Godo, P. H\'ajek and M. Navara in Residuated fuzzy logics…
In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
In this note we prove that single-conclusion admissible rules of any proper axiomatic extension of the infnite valued Lukasiewicz logic are finitely based.