On the Undecidability of Some Sub-classical First-Order Logics

On the Undecidability of Some Sub-classical First-Order Logics

A general criterion for the undecidabily of sub-classical firstorder logics and important fragments thereof is established. It is applied, among others, to Urquart’s (original version of) C and the closely related logic C*.In addition, hypersequent systems for (first-order) C and C* are introduced a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Baaz, Matthias, Ciabattoni, Agata, Fermüller, Christian, Veith, Helmut
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming theory
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 268
container_issue
container_start_page 258
container_title
container_volume 1738
creator Baaz, Matthias
Ciabattoni, Agata
Fermüller, Christian
Veith, Helmut
description A general criterion for the undecidabily of sub-classical firstorder logics and important fragments thereof is established. It is applied, among others, to Urquart’s (original version of) C and the closely related logic C*.In addition, hypersequent systems for (first-order) C and C* are introduced and shown to enjoy cut-elimination.
doi_str_mv 10.1007/3-540-46691-6_20
format Book Chapter
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1173877</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3073073_25_272</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1820-73295a3cee3ebafe81aa33d0b6c4329d9be533cf7b5be5836c663534ab60b3f73</originalsourceid><addsrcrecordid>eNotUE1PwzAMDZ-ijN059sA1I4nbpLkgoYkB0qQdxs5RkqZboWtL0h3270nHLEu2_Pye7IfQIyUzSoh4BpxnBGecS4q5YuQCTaUoIA5Ps-ISJZRTigEyeYXuR4DzAnh-jRIChGEpMrhFieSSRw6IOzQN4ZvEAAasoAl6WbXpsHPppi2drUtt6qYejmlXpetu79L1wWDb6BBqq5t0Ufsw4JUvnU-X3ba24QHdVLoJbnquE7RZvH3NP_By9f45f13inhaMYAFM5hqsc-CMrlxBtQYoieE2i1ApjcsBbCVMHrv4geUccsi04cRAJWCCnv51ex3iJZXXra2D6n291_6oKBVQiHFt9r8WItJunVem636CokSNhipQ0SJ1Mk-NhkYCnHV993twYVBuZFjXDl43dqf7wfmggIgxFcsVEwz-APRPcfk</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3073073_25_272</pqid></control><display><type>book_chapter</type><title>On the Undecidability of Some Sub-classical First-Order Logics</title><source>Springer Books</source><creator>Baaz, Matthias ; Ciabattoni, Agata ; Fermüller, Christian ; Veith, Helmut</creator><contributor>Pandu Rangan, C ; Ramanujam, R ; Raman, V ; Ramanujam, R. ; Raman, V. ; Rangan, C. Pandu</contributor><creatorcontrib>Baaz, Matthias ; Ciabattoni, Agata ; Fermüller, Christian ; Veith, Helmut ; Pandu Rangan, C ; Ramanujam, R ; Raman, V ; Ramanujam, R. ; Raman, V. ; Rangan, C. Pandu</creatorcontrib><description>A general criterion for the undecidabily of sub-classical firstorder logics and important fragments thereof is established. It is applied, among others, to Urquart’s (original version of) C and the closely related logic C*.In addition, hypersequent systems for (first-order) C and C* are introduced and shown to enjoy cut-elimination.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540668365</identifier><identifier>ISBN: 9783540668367</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540466918</identifier><identifier>EISBN: 3540466916</identifier><identifier>DOI: 10.1007/3-540-46691-6_20</identifier><identifier>OCLC: 969640437</identifier><identifier>LCCallNum: QA75.5-76.95</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Programming theory ; Theoretical computing</subject><ispartof>Foundations of Software Technology and Theoretical Computer Science, 1999, Vol.1738, p.258-268</ispartof><rights>Springer-Verlag Berlin Heidelberg 1999</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3073073-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-46691-6_20$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-46691-6_20$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27930,38260,41447,42516</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=1173877$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Pandu Rangan, C</contributor><contributor>Ramanujam, R</contributor><contributor>Raman, V</contributor><contributor>Ramanujam, R.</contributor><contributor>Raman, V.</contributor><contributor>Rangan, C. Pandu</contributor><creatorcontrib>Baaz, Matthias</creatorcontrib><creatorcontrib>Ciabattoni, Agata</creatorcontrib><creatorcontrib>Fermüller, Christian</creatorcontrib><creatorcontrib>Veith, Helmut</creatorcontrib><title>On the Undecidability of Some Sub-classical First-Order Logics</title><title>Foundations of Software Technology and Theoretical Computer Science</title><description>A general criterion for the undecidabily of sub-classical firstorder logics and important fragments thereof is established. It is applied, among others, to Urquart’s (original version of) C and the closely related logic C*.In addition, hypersequent systems for (first-order) C and C* are introduced and shown to enjoy cut-elimination.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Programming theory</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540668365</isbn><isbn>9783540668367</isbn><isbn>9783540466918</isbn><isbn>3540466916</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1999</creationdate><recordtype>book_chapter</recordtype><recordid>eNotUE1PwzAMDZ-ijN059sA1I4nbpLkgoYkB0qQdxs5RkqZboWtL0h3270nHLEu2_Pye7IfQIyUzSoh4BpxnBGecS4q5YuQCTaUoIA5Ps-ISJZRTigEyeYXuR4DzAnh-jRIChGEpMrhFieSSRw6IOzQN4ZvEAAasoAl6WbXpsHPppi2drUtt6qYejmlXpetu79L1wWDb6BBqq5t0Ufsw4JUvnU-X3ba24QHdVLoJbnquE7RZvH3NP_By9f45f13inhaMYAFM5hqsc-CMrlxBtQYoieE2i1ApjcsBbCVMHrv4geUccsi04cRAJWCCnv51ex3iJZXXra2D6n291_6oKBVQiHFt9r8WItJunVem636CokSNhipQ0SJ1Mk-NhkYCnHV993twYVBuZFjXDl43dqf7wfmggIgxFcsVEwz-APRPcfk</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Baaz, Matthias</creator><creator>Ciabattoni, Agata</creator><creator>Fermüller, Christian</creator><creator>Veith, Helmut</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>1999</creationdate><title>On the Undecidability of Some Sub-classical First-Order Logics</title><author>Baaz, Matthias ; Ciabattoni, Agata ; Fermüller, Christian ; Veith, Helmut</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1820-73295a3cee3ebafe81aa33d0b6c4329d9be533cf7b5be5836c663534ab60b3f73</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Programming theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Baaz, Matthias</creatorcontrib><creatorcontrib>Ciabattoni, Agata</creatorcontrib><creatorcontrib>Fermüller, Christian</creatorcontrib><creatorcontrib>Veith, Helmut</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Baaz, Matthias</au><au>Ciabattoni, Agata</au><au>Fermüller, Christian</au><au>Veith, Helmut</au><au>Pandu Rangan, C</au><au>Ramanujam, R</au><au>Raman, V</au><au>Ramanujam, R.</au><au>Raman, V.</au><au>Rangan, C. Pandu</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>On the Undecidability of Some Sub-classical First-Order Logics</atitle><btitle>Foundations of Software Technology and Theoretical Computer Science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1999</date><risdate>1999</risdate><volume>1738</volume><spage>258</spage><epage>268</epage><pages>258-268</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540668365</isbn><isbn>9783540668367</isbn><eisbn>9783540466918</eisbn><eisbn>3540466916</eisbn><abstract>A general criterion for the undecidabily of sub-classical firstorder logics and important fragments thereof is established. It is applied, among others, to Urquart’s (original version of) C and the closely related logic C*.In addition, hypersequent systems for (first-order) C and C* are introduced and shown to enjoy cut-elimination.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-46691-6_20</doi><oclcid>969640437</oclcid><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Foundations of Software Technology and Theoretical Computer Science, 1999, Vol.1738, p.258-268
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_1173877
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming theory
Theoretical computing
title On the Undecidability of Some Sub-classical First-Order Logics
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T08%3A24%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=On%20the%20Undecidability%20of%20Some%20Sub-classical%20First-Order%20Logics&rft.btitle=Foundations%20of%20Software%20Technology%20and%20Theoretical%20Computer%20Science&rft.au=Baaz,%20Matthias&rft.date=1999&rft.volume=1738&rft.spage=258&rft.epage=268&rft.pages=258-268&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540668365&rft.isbn_list=9783540668367&rft_id=info:doi/10.1007/3-540-46691-6_20&rft_dat=%3Cproquest_pasca%3EEBC3073073_25_272%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540466918&rft.eisbn_list=3540466916&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3073073_25_272&rft_id=info:pmid/&rfr_iscdi=true