Modal Foundations for Predicate Logic

@article{Benthem1997ModalFF,
  title={Modal Foundations for Predicate Logic},
  author={Johan van Benthem},
  journal={Log. J. IGPL},
  year={1997},
  volume={5},
  pages={259-286}
}
  • J. Benthem
  • Published 1 March 1997
  • Computer Science
  • Log. J. IGPL
The complexity of any logical modeling reeects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigatèlighter' versions of this general purpose tool, by modally`deconstructing' the usual semantics, and locating implicit choice points in its set up. The rst part sets out the interest of this program and the modal… 
Back and Forth Between Modal Logic and Classical Logic
TLDR
This paper proves decidability for a largèbounded fragment' of predicate logic, and points out several applications, including a fresh look at the landscape of possible predicate logics, including candi-685.
FROM AXIOMS TO STRUCTURAL RULES , THEN ADD QUANTIFIERS
We survey recent developments in the program of generating proof calculi for large classes of axiomatic extensions of a non-classical logics by translating each axiom into a set of structural rules,
Modal logic: a semantic perspective
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation (Extended version)
TLDR
Axiomatic bisimulations are employed to compare the relative expressive power of ordered logics, and to characterise the logics as bisimulation-invariant fragments of FO à la van Benthem, and the Craig Interpolation Property is studied.
Explicating Logical Independence
TLDR
Each of these proposals returns counterintuitive verdicts in certain cases—the truth-value inspired approach classifying certain cases one would like to describe as involving failures of independence as being cases of independence, and the de Jongh approach counting some intuitively independent pairs of formulas as not being independent after all.
Proofs, Labels and Dynamics in Natural Language
TLDR
In Dov Gabbay's view, the following equation sums up much of Dov’s recent work.
Algebraic and Proof-Theoretic Foundations of the Logics for Social Behaviour
TLDR
The results and methodologies developed in this thesis pave the way to the logical modelling of the inner workings of organizations and their dynamics, and of social phenomena such as reputational Matthew effects and bank runs.
CRS and Guarded Logics: a fruitful contact
Back and forth between algebra and model theory. Algebra and model theory are complementary stances in the history of logic, and their interaction continues to spawn new ideas, witness the interface
Beth Definability for the Guarded Fragment
TLDR
The Beth property of first order logic is considered and it is shown that, despite the failure of interpolation, it is retained in restriction to GF and even every n-variable guarded fragment with up to n-ary relations has the Beth property.
Beth definability in the Guarded Fragment Eva Hoogland ,
The guarded fragment (GF) was introduced in [1] as a fragment of first order logic which combines a great expressive power with nice modal behavior. It consists of relational first order formulas
...
...

References

SHOWING 1-10 OF 50 REFERENCES
Back and Forth Between Modal Logic and Classical Logic
TLDR
This paper proves decidability for a largèbounded fragment' of predicate logic, and points out several applications, including a fresh look at the landscape of possible predicate logics, including candi-685.
SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC
  • V. Pratt
  • Computer Science, Philosophy
    FOCS 1976
  • 1976
TLDR
An appropriate axiom system is given which is complete for loop-free programs and also puts conventional predicate calculus in a different light by lumping quantifiers with non-logical assignments rather than treating them as logical concepts.
Logic of transition systems
TLDR
This paper shows how labeled transition systems lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory, and hopes that this puts standard logical formalisms on the map as a serious option for a theory of computational processes.
Cylindric modal logic
  • Y. Venema
  • Mathematics
    Journal of Symbolic Logic
  • 1995
TLDR
From this modal viewpoint, the standard semantics of first-order logic corresponds to just one of many possible classes of Kripke frames, and that other classes might be of interest as well.
A crash course in arrow logic
TLDR
This contribution gives a short introduction to arrow logic, explaining the basic idea underlying arrow logic and the motivation for studying it and describing some closely related formalisms and some extensions and reducts of arrow logic.
Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras
The interpolatlon properties of formal theories are important and interesting. At present there area slgnificant number of works that establish Craig's interpolation theorem [8] or disprove it in
Logics of Time and Computation
Sets out the basic theory of normal modal and temporal propositional logics; applies this theory to logics of discrete (integer), dense (rational), and continuous (real) time, to the temporal logic
Transition Systems and Dynamic Semantics
TLDR
Going the other direction, first-order models are extracted from transition systems, bringing full circle the connection between static and dynamic notions.
Logic and Information Flow
Logic and information flow, Jan van Eijck and Albert Visser a note on dynamic arrow logic, Johan van Benthem axiomatizing dynamic predicate logic with quantified dynamic logic, Jan van Eijck how
Actions under presuppositions
This chapter contains sections titled: Introduction, Pictures & Updates, Some Elementary Facts Concerning Residuation Lattices, Update Functions and Partial Actions, Further Properties, Examples, An
...
...