Modal languages and bounded fragments of predicate logic

DOI10.1023/A:1004275029985zbMath0919.03013MaRDI QIDQ1267082

Istvan Németi, Hajnalka Andréka, J. F. A. K. van Benthem

Publication date: 18 November 1998

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

interpolation; modal logic; decidability; finite model property; guarded fragment; bounded quantification; fragments of first-order logic

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B20: Subsystems of classical logic (including intuitionistic logic)

Related Items

On axiomatising products of Kripke frames, Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures, On the Restraining Power of Guards, PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT, Omitting types for finite variable fragments and complete representations of algebras, Algebraic Logic, Where Does it Stand Today?, Logic between Expressivity and Complexity, Modal characterisation theorems over special classes of frames, \({\mathcal E}\)-connections of abstract description systems, Representing ontologies using description logics, description graphs, and rules, Conceptual logic programs, On the complexity of the two-variable guarded fragment with transitive guards, Open answer set programming for the semantic web, On the complexity of division and set joins in the relational algebra, Deciding expressive description logics in the framework of resolution, Ehrenfeucht-Fraïssé games in finite set theory, The many faces of interpolation, Modality, bisimulation and interpolation in infinitary logic, On temporal logic versus Datalog, Hyperresolution for guarded formulae, Uniform short proofs for classical theorems, Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators, Decidable fragments of first-order temporal logics, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Guarded fixed point logics and the monadic theory of countable trees., Deciding the guarded fragments by resolution, The finite graph problem for two-way alternating automata., The guarded fragment with transitive guards, Modal and guarded characterisation theorems over finite transition systems, Automated theorem proving by resolution in non-classical logics, On the expressive power of semijoin queries, A general method for proving decidability of intuitionistic modal logics, Guards, bounds, and generalized semantics, Guarded fragments with constants, Deciding regular grammar logics with converse through first-order logic, The semijoin algebra and the guarded fragment, A guarded fragment for abstract state machines, Complexity of monodic guarded fragments over linear and real time, Decidable fragments of first-order modal logics, Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications, 2004 Summer Meeting of the Association for Symbolic Logic, Interpolation for extended modal languages, Decidability of the Class E by Maslov’s Inverse Method, Repetitions and permutations of columns in the semijoin algebra, Modal logic and invariance, ON DEFINABILITY IN MULTIMODAL LOGIC, On a theorem of Vaught for first order logic with finitely many variables, Combining Description Logics, Description Graphs, and Rules, Finite algebras of relations are representable on finite sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Natural deduction and arbitrary objects
• Der Interpolationssatz der intuitionistischen Prädikatenlogik
• Language in action
• Algebraization of quantifier logics, an introductory overview
• On universal algebraic constructions of logics
• Finite \(H\)-dimension does not imply expressive completeness
• Multi-dimensional modal logic
• Model theory
• Logic of transition systems
• On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic
• Representations of distributive lattice-ordered semigroups with binary relations
• Amalgamation, congruence-extension, and interpolation properties in algebras
• The metatheory of the classical propositional calculus is not axiomatizable
• Algebraic laws for nondeterminism and concurrency
• Semantics-Based Translation Methods for Modal Logics
• Properties of independently axiomatizable bimodal logics
• A Modal Logic for Chopping Intervals
• Modal reduction principles
• Cylindric-relativised set algebras have strong amalgamation
• Correspondence and Completeness for Generalized Quantifiers
• Cylindric modal logic
• Expressibility of properties of relations
• Nonfinitizability of classes of representable cylindric algebras