NOTE ON CUT ELIMINATION AND COMPLETENESS IN FIRST-ORDER THEORIES

被引：0
|
作者：
BOWEN, KA
机构：
来源：
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK | 1972年 / 18卷 / 02期
关键词：
D O I：
10.1002/malq.19720180807
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：173 / &
相关论文
共 50 条
  • [41] UNDECIDABLE FIRST-ORDER THEORIES OF AFFINE GEOMETRIES
    Kuusisto, Antti
    Meyers, Jeremy
    Virtema, Jonni
    LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (04)
  • [42] Adding metatheoretic facilities to first-order theories
    Basin, D
    Matthews, S
    JOURNAL OF LOGIC AND COMPUTATION, 1996, 6 (06) : 835 - 849
  • [43] Pairs, sets and sequences in first-order theories
    Visser, Albert
    ARCHIVE FOR MATHEMATICAL LOGIC, 2008, 47 (04) : 299 - 326
  • [44] 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
  • [45] Jurisprudential Theories and First-Order Legal Judgments
    Toh, Kevin
    PHILOSOPHY COMPASS, 2013, 8 (05): : 457 - 471
  • [46] Probabilistic characterisation of models of first-order theories
    Rad, Soroush Rafiee
    ANNALS OF PURE AND APPLIED LOGIC, 2021, 172 (01)
  • [47] The Complexity of Decomposing Modal and First-Order Theories
    Goeller, Stefan
    Jung, Jean-Christoph
    Lohrey, Markus
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2015, 16 (01)
  • [48] First-order and counting theories of ω-automatic structures
    Kuske, Dietrich
    Lohrey, Markus
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2006, 3921 : 322 - 336
  • [49] First-order and counting theories of ω-automatic structures
    Kuske, Dietrich
    Lohrey, Markus
    JOURNAL OF SYMBOLIC LOGIC, 2008, 73 (01) : 129 - 150
  • [50] Definability in first-order theories of graph orderings
    Ramanujam, R.
    Thinniyam, Ramanathan S.
    JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 403 - 420
12345