520 research outputs found

    Admissibility via Natural Dualities

    Get PDF
    It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may be characterized using natural dualities. In particular, axiomatizations are obtained for the admissible clauses and quasi-identities of bounded distributive lattices, Stone algebras, Kleene algebras and lattices, and De Morgan algebras and lattices.Comment: 22 pages; 3 figure

    MetTeL: A Generic Tableau Prover.

    Get PDF

    Complete Additivity and Modal Incompleteness

    Get PDF
    In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, V-BAOs. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem's paper resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to V-BAOs, namely the provability logic GLB. We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is V-complete. After these results, we generalize the Blok Dichotomy to degrees of V-incompleteness. In the end, we return to van Benthem's theme of syntactic aspects of modal incompleteness

    Through and beyond classicality: analyticity, embeddings, infinity

    Get PDF
    Structural proof theory deals with formal representation of proofs and with the investigation of their properties. This thesis provides an analysis of various non-classical logical systems using proof-theoretic methods. The approach consists in the formulation of analytic calculi for these logics which are then used in order to study their metalogical properties. A specific attention is devoted to studying the connections between classical and non-classical reasoning. In particular, the use of analytic sequent calculi allows one to regain desirable structural properties which are lost in non-classical contexts. In this sense, proof-theoretic versions of embeddings between non-classical logics - both finitary and infinitary - prove to be a useful tool insofar as they build a bridge between different logical regions

    Exact Unification and Admissibility

    Full text link

    Grafting Hypersequents onto Nested Sequents

    Full text link
    We introduce a new Gentzen-style framework of grafted hypersequents that combines the formalism of nested sequents with that of hypersequents. To illustrate the potential of the framework, we present novel calculi for the modal logics K5\mathsf{K5} and KD5\mathsf{KD5}, as well as for extensions of the modal logics K\mathsf{K} and KD\mathsf{KD} with the axiom for shift reflexivity. The latter of these extensions is also known as SDL+\mathsf{SDL}^+ in the context of deontic logic. All our calculi enjoy syntactic cut elimination and can be used in backwards proof search procedures of optimal complexity. The tableaufication of the calculi for K5\mathsf{K5} and KD5\mathsf{KD5} yields simplified prefixed tableau calculi for these logic reminiscent of the simplified tableau system for S5\mathsf{S5}, which might be of independent interest
    • …
    corecore