Book Chapter10.1007/978-94-017-1280-4_12
Predicate Logics on Display
14
TL;DR: The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic and considers predicate logics obtained by adopting van Behthem's modal perspective on first-order logic.
read more
Abstract: This chapter provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Benthem’s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap’s display logic, DL 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 be derived. En route from the minimal ‘modal’ predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules. The chapter has two main aims, namely
1.
presenting a uniform proof-theoretic schema for both substructural subsystems of classical first-order logic, FOL and various subsystems of FOL obtained by relaxing Tarski’s truth definition for the existential and universal quantifiers, and
2.
introducing these quantifiers into the framework of DL.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Hypersequent and Display Calculi --- a Unified Perspective
TL;DR: This paper presents an overview of the methods of hypersequents and display sequents in the proof theory of non-classical logics highlighting their differences and similarities and discussing applications and recent results connecting and comparing them.
Displaying the modal logic of consistency
TL;DR: It is shown that the constructive four-valued logic N4 can be faithfully embedded into the modal logic S4 and this embedding is used to obtain complete, cut-free display sequent calculi for N4 and C4.
14
Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics
TL;DR: Both ground and free variable tableau methods are defined, parametric with respect to the variants of the considered logics, based on the annotation of functional symbols by natural numbers, to help in understanding the reasons for some details in basic definitions.
9
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation
Serenella Cerrito,Marta Cialdea Mayer +1 more
- 18 Jun 2001
TL;DR: This paper presents a sound and complete free-variable tableau calculus for constant-domain quantified modal logics, with a propositional analytical basis, i.e. one of the systems K, D, T, K4, S4.
8
•Posted Content
Rooted Hypersequent Calculus for Modal Logic S5
Mojtaba Aghaei,Hamzeh Mohammadi +1 more
TL;DR: In this article, a rooted hypersequent calculus for modal propositional logic S5 is presented, and all rules of this calculus are invertible and the rules of weakening, contraction, and cut are admissible.
5
References
•Book
A mathematical introduction to logic
Herbert B. Enderton
- 01 Jan 1972
TL;DR: A comparison of first- and second-order logic in the case of SETs shows that the former is more likely to be correct and the latter is less likely.
2.6K
Power and Weakness of the Modal Display Calculus
Marcus Kracht
- 01 Jan 1996
TL;DR: In this paper, the authors explore applications of Display Logic as defined in [1] to modal logic, which is a proof-theoretic system that was developed to explore in depth the possibility of total Gentzenization of various propositional logics.
Extending modal logic
M. de Rijke
- 01 Jan 1993
TL;DR: In this paper, the authors propose a modal logic based algebraic approach for algebraic modality, and apply it to algebraic algebraic logic.modal logic, 121 algebra
98