ONE-VARIABLE FRAGMENTS OF FIRST-ORDER LOGICS

被引:0
|
作者
Cintula, Petr [1 ]
Metcalfe, George [2 ]
Tokuda, Naomi [2 ]
机构
[1] Czech Acad Sci, Inst Comp Sci, Prague, Czech Republic
[2] Univ Bern, Math Inst, Bern, Switzerland
基金
瑞士国家科学基金会;
关键词
first-order logic; one-variable fragment; modal logic; substructural logic; superamalgamation; sequent calculus; MACNEILLE COMPLETIONS;
D O I
10.1017/bsl.2024.22
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 S5 and 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.
引用
收藏
页码:253 / 278
页数:26
相关论文
共 50 条
  • [41] Logics for at most countable first-order structures
    Perovic, Aleksandar
    Ognjanovic, Zoran
    Stojanovic, Tatjana
    JOURNAL OF LOGIC AND COMPUTATION, 2024,
  • [42] On first-order fragments for Mazurkiewicz traces
    Diekert, Volker
    Horsch, Martin
    Kufleitner, Manfred
    FUNDAMENTA INFORMATICAE, 2007, 80 (1-3) : 1 - 29
  • [43] The One-Variable Fragment of T→
    John Slaney
    Edward Walker
    Journal of Philosophical Logic, 2014, 43 : 867 - 878
  • [44] First-order logics: some characterizations and closure properties
    Christian Choffrut
    Andreas Malcher
    Carlo Mereghetti
    Beatrice Palano
    Acta Informatica, 2012, 49 : 225 - 248
  • [45] Embedding Friendly First-Order Paradefinite and Connexive Logics
    Kamide, Norihiro
    JOURNAL OF PHILOSOPHICAL LOGIC, 2022, 51 (05) : 1055 - 1102
  • [46] Fibring model first-order logics: Completeness preservation
    Sernadas, A
    Sernadas, C
    Zanardo, A
    LOGIC JOURNAL OF THE IGPL, 2002, 10 (04) : 413 - 451
  • [47] Embedding Friendly First-Order Paradefinite and Connexive Logics
    Norihiro Kamide
    Journal of Philosophical Logic, 2022, 51 : 1055 - 1102
  • [48] Evidence Algorithm and Inference Search in First-Order Logics
    Alexander Lyaletski
    Journal of Automated Reasoning, 2015, 55 : 269 - 284
  • [49] Implementing and Evaluating Provers for First-order Modal Logics
    Benzmueller, Christoph
    Otten, Jens
    Raths, Thomas
    20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 163 - +
  • [50] First-order non-monotonic modal logics
    Kaminski, Michael
    Guy, Rey
    Fundamenta Informaticae, 2000, 42 (03) : 303 - 333