Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences

被引:3
|
作者
Beckmann, Arnold [1 ]
Preining, Norbert [2 ]
机构
[1] Swansea Univ, Dept Comp Sci, Coll Sci, Swansea SA2 8PP, W Glam, Wales
[2] Japan Adv Inst Sci & Technol, Res Ctr Software Verificat, Nomi, Ishikawa 9231292, Japan
关键词
Intermediate logics; Kripke frames; ordinals; monadic logic; GODEL LOGICS; CONJECTURE;
D O I
10.1093/logcom/exu016
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider intermediate predicate logics defined by fixed well-ordered (or dually well-ordered) linear Kripke frames with constant domains where the order-type of the well-order is strictly smaller than omega(omega). We show that two such logics of different order-type are separated by a first-order sentence using only one monadic predicate symbol. Previous results by Minari, Takano and Ono, as well as the second author, obtained the same separation but relied on the use of predicate symbols of unbounded arity.
引用
收藏
页码:527 / 547
页数:21
相关论文
共 50 条
  • [21] Paramodulation with Well-founded Orderings
    Bofill, Miquel
    Rubio, Albert
    JOURNAL OF LOGIC AND COMPUTATION, 2009, 19 (02) : 263 - 302
  • [22] IS FREUD THEORY WELL-FOUNDED
    GRUNBAUM, A
    BEHAVIORAL AND BRAIN SCIENCES, 1986, 9 (02) : 266 - 281
  • [23] A Well-Founded Semantics with disjunction
    Alcântara, J
    Damásio, CV
    Pereira, LM
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 341 - 355
  • [24] Aggregation and well-founded semantics
    Osorio, M
    Jayaraman, B
    NON-MONOTONIC EXTENSIONS OF LOGIC PROGRAMMING, 1997, 1216 : 71 - 90
  • [25] ARE CRITICISMS OF EXERCISE WELL-FOUNDED
    SHEPHARD, RJ
    CANADIAN FAMILY PHYSICIAN, 1986, 32 : 139 - &
  • [26] Possibilistic Well-Founded Semantics
    Osorio, Mauricio
    Carlos Nieves, Juan
    MICAI 2009: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5845 : 15 - +
  • [27] A Well-Founded Software Measurement Ontology
    Barcellos, Monalessa Perini
    Falbo, Ricardo de Almeida
    Dal Moro, Rodrigo
    FORMAL ONTOLOGY IN INFORMATION SYSTEMS (FOIS 2010), 2010, 209 : 213 - 226
  • [28] A type system for well-founded recursion
    Dreyer, D
    ACM SIGPLAN NOTICES, 2004, 39 (01) : 293 - 305
  • [29] An Engine for Computing Well-Founded Models
    Swift, Terrance
    LOGIC PROGRAMMING, 2009, 5649 : 514 - 518
  • [30] Well-founded semantics for defeasible logic
    Frederick Maier
    Donald Nute
    Synthese, 2010, 176 : 243 - 274