Switch to: References

Add citations

You must login to add citations.
  1. Predicate logics on display.Heinrich Wansing - 1999 - Studia Logica 62 (1):49-75.
    The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Cylindric modal logic.Yde Venema - 1995 - Journal of Symbolic Logic 60 (2):591-623.
    Treating the existential quantification ∃ν i as a diamond $\diamond_i$ and the identity ν i = ν j as a constant δ ij , we study restricted versions of first order logic as if they were modal formalisms. This approach is closely related to algebraic logic, as the Kripke frames of our system have the type of the atom structures of cylindric algebras; the full cylindric set algebras are the complex algebras of the intended multidimensional frames called cubes. The main (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  • Weakly higher order cylindric algebras and finite axiomatization of the representables.I. Németi & A. Simon - 2009 - Studia Logica 91 (1):53 - 62.
    We show that the variety of n -dimensional weakly higher order cylindric algebras, introduced in Németi [9], [8], is finitely axiomatizable when n > 2. Our result implies that in certain non-well-founded set theories the finitization problem of algebraic logic admits a positive solution; and it shows that this variety is a good candidate for being the cylindric algebra theoretic counterpart of Tarski’s quasi-projective relation algebras.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the complexity of axiomatizations of the class of representable quasi‐polyadic equality algebras.Tarek Sayed Ahmed - 2011 - Mathematical Logic Quarterly 57 (4):384-394.
    Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEAα of representable quasi-polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi-polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEAn for equation image and equation imageequation image, k′ < ω are natural numbers, then Σ contains infinitely equations in which − occurs, one of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hybrid Logics: Characterization, Interpolation and Complexity.Carlos Areces, Patrick Blackburn & Maarten Marx - 2001 - Journal of Symbolic Logic 66 (3):977-1010.
    Hybrid languages are expansions of propositional modal languages which can refer to worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work has focussed on a more constrained system called $\mathscr{H}$. We show in detail that $\mathscr{H}$ is modally natural. We begin by studying its expressivity, and provide model theoretic characterizations and a syntactic characterization. The key result to emerge is that $\mathscr{H}$ corresponds to the fragment of first-order logic which is invariant for generated (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   39 citations