Algebraization of quantifier logics, an introductory overview

From MaRDI portal
Publication:1189899

DOI10.1007/BF00370684zbMath0772.03033OpenAlexW1481249376MaRDI QIDQ1189899

Istvan Németi

Publication date: 27 September 1992

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370684




Related Items (42)

Weakly representable but not representable relation algebrasRelational lattices: from databases to universal algebraTowards automating dualitySahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebrasDerivation rules as anti-axioms in modal logicOn notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equalityA note on neat reductsElementary generation and canonicity for varieties of Boolean algebras with operatorsA finitely axiomatized formalization of predicate calculus with equalityDirections in generalized quantifier theoryRelation algebras of intervalsCylindric modal logicA short proof of representability of fork algebrasOn the algebraization of Henkin‐type second‐order logicThe universal theory of first order algebras and various reductsSquares in fork arrow logicMonadic bounded residuated latticesHow many varieties of cylindric algebras are thereStep by step – Building representations in algebraic logicNew perspectives in algebraic logic, from neat embeddings to Erdős graphsAxiomatizability of positive algebras of binary relationsOn fork arrow logic and its expressive powerMonadic GMV-algebrasUndecidable theories of Lyndon algebrasInterpolation and amalgamation in modal cylindric algebrasMonadic bounded commutative residuated \(\ell\)-monoidsLambda abstraction algebras: representation theoremsComplexity of equational theory of relational algebras with standard projection elementsRepresentations of distributive lattice-ordered semigroups with binary relationsOn the definition and the representability of quasi-polyadic equality algebrasCylindric structures and dependencies in relational databasesA representation theorem for measurable relation algebrasMonadic bounded hoopsOn Algebraisation of Superintuitionistic Predicate LogicsModal languages and bounded fragments of predicate logicA finite equational axiomatization of the functional algebras for the lambda calculusNotions of density that imply representability in algebraic logicA note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphismOn the algebraic models of lambda calculusMany-dimensional arrow logicsAlgebraic Logic and Knowledge BasesLambek calculus and its relational semantics: Completeness and incompleteness



Cites Work


This page was built for publication: Algebraization of quantifier logics, an introductory overview