Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation
In [7] and [8], Iemhoff introduced a connection between the existence of a terminating sequent calculi of a certain kind and the uniform interpolation property of the super-intuitionistic logic that the calculus captures. In this paper, we will generalize this relationship to also cover the substruc...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Tabatabai, Amirhossein Akbar Jalali, Raheleh |
description | In [7] and [8], Iemhoff introduced a connection between the existence of a
terminating sequent calculi of a certain kind and the uniform interpolation
property of the super-intuitionistic logic that the calculus captures. In this
paper, we will generalize this relationship to also cover the substructural
setting on the one hand and a much more powerful class of rules on the other.
The resulted relationship then provides a uniform method to establish uniform
interpolation property for the logics $\mathbf{FL_e}$, $\mathbf{FL_{ew}}$,
$\mathbf{CFL_e}$, $\mathbf{CFL_{ew}}$, $\mathbf{IPC}$, $\mathbf{CPC}$ and their
$\mathbf{K}$ and $\mathbf{KD}$-type modal extensions. More interestingly
though, on the negative side, we will show that no extension of $\mathbf{FL_e}$
can enjoy a certain natural type of terminating sequent calculus unless it has
the uniform interpolation property. It excludes almost all super-intutionistic
logics and the logics $\mathbf{K4}$ and $\mathbf{S4}$ from having such a
reasonable calculus. |
doi_str_mv | 10.48550/arxiv.1808.06258 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1808_06258</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808_06258</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-5f8372ff657dcea5ffc65db23a2dd740c6b3b92b3971eaa7dcde1f75576ba6283</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvDKhwAUz1DSQ4dv1TNlQVqFQJBOkcfY4_C0uOXTmhIndPKUxneXWkh5C7htUrIyW7h_IdTnVjmKmZ4tJck-0hhROWESJ9Kzl72n5iLvMD_cAhVJAgzlPo6ftXxJFCcvTc-1wGuksTlmOOMIWcbsiVhzji7f8uSPu0bTcv1f71ebd53FegtKmkN0Jz75XUrkeQ3vdKOssFcOf0ivXKCrvmVqx1gwDnyGHjtZRaWVDciAVZ_t1eHN2xhAHK3P16uotH_AAL5kbF</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation</title><source>arXiv.org</source><creator>Tabatabai, Amirhossein Akbar ; Jalali, Raheleh</creator><creatorcontrib>Tabatabai, Amirhossein Akbar ; Jalali, Raheleh</creatorcontrib><description>In [7] and [8], Iemhoff introduced a connection between the existence of a
terminating sequent calculi of a certain kind and the uniform interpolation
property of the super-intuitionistic logic that the calculus captures. In this
paper, we will generalize this relationship to also cover the substructural
setting on the one hand and a much more powerful class of rules on the other.
The resulted relationship then provides a uniform method to establish uniform
interpolation property for the logics $\mathbf{FL_e}$, $\mathbf{FL_{ew}}$,
$\mathbf{CFL_e}$, $\mathbf{CFL_{ew}}$, $\mathbf{IPC}$, $\mathbf{CPC}$ and their
$\mathbf{K}$ and $\mathbf{KD}$-type modal extensions. More interestingly
though, on the negative side, we will show that no extension of $\mathbf{FL_e}$
can enjoy a certain natural type of terminating sequent calculus unless it has
the uniform interpolation property. It excludes almost all super-intutionistic
logics and the logics $\mathbf{K4}$ and $\mathbf{S4}$ from having such a
reasonable calculus.</description><identifier>DOI: 10.48550/arxiv.1808.06258</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science ; Mathematics - Logic</subject><creationdate>2018-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1808.06258$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1808.06258$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Tabatabai, Amirhossein Akbar</creatorcontrib><creatorcontrib>Jalali, Raheleh</creatorcontrib><title>Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation</title><description>In [7] and [8], Iemhoff introduced a connection between the existence of a
terminating sequent calculi of a certain kind and the uniform interpolation
property of the super-intuitionistic logic that the calculus captures. In this
paper, we will generalize this relationship to also cover the substructural
setting on the one hand and a much more powerful class of rules on the other.
The resulted relationship then provides a uniform method to establish uniform
interpolation property for the logics $\mathbf{FL_e}$, $\mathbf{FL_{ew}}$,
$\mathbf{CFL_e}$, $\mathbf{CFL_{ew}}$, $\mathbf{IPC}$, $\mathbf{CPC}$ and their
$\mathbf{K}$ and $\mathbf{KD}$-type modal extensions. More interestingly
though, on the negative side, we will show that no extension of $\mathbf{FL_e}$
can enjoy a certain natural type of terminating sequent calculus unless it has
the uniform interpolation property. It excludes almost all super-intutionistic
logics and the logics $\mathbf{K4}$ and $\mathbf{S4}$ from having such a
reasonable calculus.</description><subject>Computer Science - Logic in Computer Science</subject><subject>Mathematics - Logic</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvDKhwAUz1DSQ4dv1TNlQVqFQJBOkcfY4_C0uOXTmhIndPKUxneXWkh5C7htUrIyW7h_IdTnVjmKmZ4tJck-0hhROWESJ9Kzl72n5iLvMD_cAhVJAgzlPo6ftXxJFCcvTc-1wGuksTlmOOMIWcbsiVhzji7f8uSPu0bTcv1f71ebd53FegtKmkN0Jz75XUrkeQ3vdKOssFcOf0ivXKCrvmVqx1gwDnyGHjtZRaWVDciAVZ_t1eHN2xhAHK3P16uotH_AAL5kbF</recordid><startdate>20180819</startdate><enddate>20180819</enddate><creator>Tabatabai, Amirhossein Akbar</creator><creator>Jalali, Raheleh</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20180819</creationdate><title>Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation</title><author>Tabatabai, Amirhossein Akbar ; Jalali, Raheleh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-5f8372ff657dcea5ffc65db23a2dd740c6b3b92b3971eaa7dcde1f75576ba6283</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Mathematics - Logic</topic><toplevel>online_resources</toplevel><creatorcontrib>Tabatabai, Amirhossein Akbar</creatorcontrib><creatorcontrib>Jalali, Raheleh</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tabatabai, Amirhossein Akbar</au><au>Jalali, Raheleh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation</atitle><date>2018-08-19</date><risdate>2018</risdate><abstract>In [7] and [8], Iemhoff introduced a connection between the existence of a
terminating sequent calculi of a certain kind and the uniform interpolation
property of the super-intuitionistic logic that the calculus captures. In this
paper, we will generalize this relationship to also cover the substructural
setting on the one hand and a much more powerful class of rules on the other.
The resulted relationship then provides a uniform method to establish uniform
interpolation property for the logics $\mathbf{FL_e}$, $\mathbf{FL_{ew}}$,
$\mathbf{CFL_e}$, $\mathbf{CFL_{ew}}$, $\mathbf{IPC}$, $\mathbf{CPC}$ and their
$\mathbf{K}$ and $\mathbf{KD}$-type modal extensions. More interestingly
though, on the negative side, we will show that no extension of $\mathbf{FL_e}$
can enjoy a certain natural type of terminating sequent calculus unless it has
the uniform interpolation property. It excludes almost all super-intutionistic
logics and the logics $\mathbf{K4}$ and $\mathbf{S4}$ from having such a
reasonable calculus.</abstract><doi>10.48550/arxiv.1808.06258</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1808.06258 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1808_06258 |
source | arXiv.org |
subjects | Computer Science - Logic in Computer Science Mathematics - Logic |
title | Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T12%3A28%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Universal%20Proof%20Theory:%20Semi-analytic%20Rules%20and%20Uniform%20Interpolation&rft.au=Tabatabai,%20Amirhossein%20Akbar&rft.date=2018-08-19&rft_id=info:doi/10.48550/arxiv.1808.06258&rft_dat=%3Carxiv_GOX%3E1808_06258%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |