Synthetic Tableaux with Unrestricted Cut for First-Order Theories

被引:3
|
作者
Leszczynska-Jasion, Dorota [1 ]
Chlebowski, Szymon [1 ]
机构
[1] Adam Mickiewicz Univ, Fac Psychol & Cognit Sci, Dept Log & Cognit Sci, Ul Szamarzewskiego 89a, PL-60568 Poznan, Poland
关键词
synthetic tableaux; principle of bivalence; cut; first-order theory; universal axiom;
D O I
10.3390/axioms8040133
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The method of synthetic tableaux is a cut-based tableau system with synthesizing rules introducing complex formulas. In this paper, we present the method of synthetic tableaux for Classical First-Order Logic, and we propose a strategy of extending the system to first-order theories axiomatized by universal axioms. The strategy was inspired by the works of Negri and von Plato. We illustrate the strategy with two examples: synthetic tableaux systems for identity and for partial order.
引用
收藏
页数:25
相关论文
共 50 条
  • [21] UNDECIDABLE FIRST-ORDER THEORIES OF AFFINE GEOMETRIES
    Kuusisto, Antti
    Meyers, Jeremy
    Virtema, Jonni
    LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (04)
  • [22] Adding metatheoretic facilities to first-order theories
    Basin, D
    Matthews, S
    JOURNAL OF LOGIC AND COMPUTATION, 1996, 6 (06) : 835 - 849
  • [23] Pairs, sets and sequences in first-order theories
    Visser, Albert
    ARCHIVE FOR MATHEMATICAL LOGIC, 2008, 47 (04) : 299 - 326
  • [24] The Complexity of Decomposing Modal and First-Order Theories
    Goeller, Stefan
    Jung, Jean Christoph
    Lohrey, Markus
    2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 325 - 334
  • [25] Jurisprudential Theories and First-Order Legal Judgments
    Toh, Kevin
    PHILOSOPHY COMPASS, 2013, 8 (05): : 457 - 471
  • [26] Probabilistic characterisation of models of first-order theories
    Rad, Soroush Rafiee
    ANNALS OF PURE AND APPLIED LOGIC, 2021, 172 (01)
  • [27] The Complexity of Decomposing Modal and First-Order Theories
    Goeller, Stefan
    Jung, Jean-Christoph
    Lohrey, Markus
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2015, 16 (01)
  • [28] First-order and counting theories of ω-automatic structures
    Kuske, Dietrich
    Lohrey, Markus
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2006, 3921 : 322 - 336
  • [29] First-order and counting theories of ω-automatic structures
    Kuske, Dietrich
    Lohrey, Markus
    JOURNAL OF SYMBOLIC LOGIC, 2008, 73 (01) : 129 - 150
  • [30] Definability in first-order theories of graph orderings
    Ramanujam, R.
    Thinniyam, Ramanathan S.
    JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 403 - 420