scientific article; zbMATH DE number 1047511
The present work is part of an interesting joint project with H. Andreka and J. van Benthem in which the authors decompose FOL (=First-Order Logic) into a hierarchy of well-behaving but weaker logics. In order to have a grasp on the fine structure of FOL, the authors reconstruct FOL as a propositional modal logic treating all extra-Boolean features of FOL as distinct modalities. This paper is well written and organised as follows: 1 Introduction, 2 First-Order Logic with Generalized Semantics, 3 Polyadic Cylindric-Relativized Set Algebras and Connections with Generalised Semantics, 4 Decidability of the Universal Theory of Polyadic Cylindric-Relativized Set Algebras. For the entire collection see [Zbl 0859.00018].
- Idealization in applied first-order logic
- Guards, bounds, and generalized semantics
- Epsilon-logic is more expressive than first-order logic over finite structures
- Fundamental significance of the finitary and infinitary semantic layers and characterization of the expressive power of first-order logic
- scientific article; zbMATH DE number 638619 (Why is no real title available?)
- AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES
- First order rough logic -- revisited
- scientific article; zbMATH DE number 3893196 (Why is no real title available?)
- A Categorical Aspect of the Analogy Between Quantifiers and Modalities
- INTERLEAVING LOGIC AND COUNTING
- A version of predicate logic with two variables that has an incompleteness property
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349288)