No Cover Image

Journal article 1238 views

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

A. Beckmann, N. Preining, Arnold Beckmann Orcid Logo

Journal of Logic and Computation

Swansea University Author: Arnold Beckmann Orcid Logo

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
Published: 2014
URI: https://cronfa.swan.ac.uk/Record/cronfa17522
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2014-03-25T02:30:08Z
last_indexed 2018-02-09T04:51:13Z
id cronfa17522
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-01-15T08:52:14.7636691</datestamp><bib-version>v2</bib-version><id>17522</id><entry>2014-03-24</entry><title>Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences</title><swanseaauthors><author><sid>1439ebd690110a50a797b7ec78cca600</sid><ORCID>0000-0001-7958-5790</ORCID><firstname>Arnold</firstname><surname>Beckmann</surname><name>Arnold Beckmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2014-03-24</date><deptcode>SCS</deptcode><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-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.</abstract><type>Journal Article</type><journal>Journal of Logic and Computation</journal><publisher/><keywords/><publishedDay>31</publishedDay><publishedMonth>3</publishedMonth><publishedYear>2014</publishedYear><publishedDate>2014-03-31</publishedDate><doi>10.1093/logcom/exu016</doi><url/><notes></notes><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-01-15T08:52:14.7636691</lastEdited><Created>2014-03-24T08:32:00.8448078</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>A.</firstname><surname>Beckmann</surname><order>1</order></author><author><firstname>N.</firstname><surname>Preining</surname><order>2</order></author><author><firstname>Arnold</firstname><surname>Beckmann</surname><orcid>0000-0001-7958-5790</orcid><order>3</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 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 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science A. Beckmann 1 N. Preining 2 Arnold Beckmann 0000-0001-7958-5790 3
title Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
spellingShingle Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
Arnold Beckmann
title_short Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
title_full Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
title_fullStr Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
title_full_unstemmed Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
title_sort Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
author_id_str_mv 1439ebd690110a50a797b7ec78cca600
author_id_fullname_str_mv 1439ebd690110a50a797b7ec78cca600_***_Arnold Beckmann
author Arnold Beckmann
author2 A. Beckmann
N. Preining
Arnold Beckmann
format Journal article
container_title Journal of Logic and Computation
publishDate 2014
institution Swansea University
doi_str_mv 10.1093/logcom/exu016
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description 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.
published_date 2014-03-31T03:20:14Z
_version_ 1763750565423087616
score 11.014291

Similar Items