Journal article 545 views

Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences / Arnold, Beckmann

Journal of Logic and Computation

Swansea University Author:

Full text not available from this repository: check for access using links below.

DOI (Published version): 10.1093/logcom/exu016

Abstract

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-o...

Full description

Published in: Journal of Logic and Computation 2014 https://cronfa.swan.ac.uk/Record/cronfa17522 No Tags, Be the first to tag this record!
first_indexed 2014-03-25T02:30:08Z 2018-02-09T04:51:13Z cronfa17522 SURis 2015-01-15T08:52:14.7636691v2175222014-03-24Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences1439ebd690110a50a797b7ec78cca6000000-0001-7958-5790ArnoldBeckmannArnold Beckmanntruefalse2014-03-24SCSWe 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.Journal ArticleJournal of Logic and Computation31320142014-03-3110.1093/logcom/exu016COLLEGE NANMEComputer ScienceCOLLEGE CODESCSSwansea University2015-01-15T08:52:14.76366912014-03-24T08:32:00.8448078College of ScienceComputer ScienceA.Beckmann1N.Preining2ArnoldBeckmann0000-0001-7958-57903 2015-01-15T08:52:14.7636691 v2 17522 2014-03-24 Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences 1439ebd690110a50a797b7ec78cca600 0000-0001-7958-5790 Arnold Beckmann Arnold Beckmann true false 2014-03-24 SCS 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. Journal Article Journal of Logic and Computation 31 3 2014 2014-03-31 10.1093/logcom/exu016 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-01-15T08:52:14.7636691 2014-03-24T08:32:00.8448078 College of Science Computer Science A. Beckmann 1 N. Preining 2 Arnold Beckmann 0000-0001-7958-5790 3 Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Arnold, Beckmann Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences 1439ebd690110a50a797b7ec78cca600 1439ebd690110a50a797b7ec78cca600_***_Arnold, Beckmann Arnold, Beckmann Journal article Journal of Logic and Computation 2014 Swansea University 10.1093/logcom/exu016 College of Science collegeofscience College of Science collegeofscience College of Science Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science 0 0 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. 2014-03-31T19:26:54Z 1667869195348475904 10.900483