Skolemization for Substructural Logics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F15%3A00448462" target="_blank" >RIV/67985807:_____/15:00448462 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-48899-7_1" target="_blank" >http://dx.doi.org/10.1007/978-3-662-48899-7_1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-48899-7_1" target="_blank" >10.1007/978-3-662-48899-7_1</a>
Alternative languages
Result language
angličtina
Original language name
Skolemization for Substructural Logics
Original language description
The usual Skolemization procedure, which removes strong quantifiers by introducing new function symbols, is in general unsound for first-order substructural logics defined based on classes of complete residuated lattices. However, it is shown here (following similar ideas of Baaz and Iemho for first-order intermediate logics in [1]) that firstorder substructural logics with a semantics satisfying certain witnessing conditions admit a " Skolemization procedure where a strong quantifier is removed by introducing a finite disjunction or conjunction (as appropriate) of formulas with multiple new function symbols. These logics typically lack equivalent prenex forms. Also, semantic consequence does not in general reduce to satisfiability. The Skolemization theorems presented here therefore take various forms, applying to the left or right of the consequence relation, and to all formulas or only prenex formulas.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Logic for Programming, Artificial Intelligence, and Reasoning
ISBN
978-3-662-48898-0
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
1-15
Publisher name
Springer
Place of publication
Berlin
Event location
Suva
Event date
Nov 24, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—