Hostname: page-component-89b8bd64d-mmrw7 Total loading time: 0 Render date: 2026-05-09T04:19:05.180Z Has data issue: false hasContentIssue false

ONE-VARIABLE FRAGMENTS OF FIRST-ORDER LOGICS

Published online by Cambridge University Press:  01 April 2024

PETR CINTULA
Affiliation:
INSTITUTE OF COMPUTER SCIENCE CZECH ACADEMY OF SCIENCES PRAGUE, CZECH REPUBLIC E-mail: cintula@cs.cas.cz
GEORGE METCALFE
Affiliation:
MATHEMATICAL INSTITUTE UNIVERSITY OF BERN BERN, SWITZERLAND E-mail: george.metcalfe@unibe.ch
NAOMI TOKUDA
Affiliation:
MATHEMATICAL INSTITUTE UNIVERSITY OF BERN BERN, SWITZERLAND E-mail: naomi.tokuda@unibe.ch
Rights & Permissions [Opens in a new window]

Abstract

The one-variable fragment of a first-order logic may be viewed as an “S5-like” modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have been obtained for special cases—notably, the modal counterparts $\mathrm {S5}$ and $\mathrm {MIPC}$ of the one-variable fragments of first-order classical logic and first-order intuitionistic logic, respectively—but a general approach, extending beyond first-order intermediate logics, has been lacking. To this end, a sufficient criterion is given in this paper for the one-variable fragment of a semantically defined first-order logic—spanning families of intermediate, substructural, many-valued, and modal logics—to admit a certain natural axiomatization. More precisely, an axiomatization is obtained for the one-variable fragment of any first-order logic based on a variety of algebraic structures with a lattice reduct that has the superamalgamation property, using a generalized version of a functional representation theorem for monadic Heyting algebras due to Bezhanishvili and Harding. An alternative proof-theoretic strategy for obtaining such axiomatization results is also developed for first-order substructural logics that have a cut-free sequent calculus and admit a certain interpolation property.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
Figure 0

Figure 1 The sequent calculus ${\mathrm {\forall 1FL_e}}$.