Herbrand Theorems 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_____%2F13%3A00422069" target="_blank" >RIV/67985807:_____/13:00422069 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-45221-5_39" target="_blank" >http://dx.doi.org/10.1007/978-3-642-45221-5_39</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45221-5_39" target="_blank" >10.1007/978-3-642-45221-5_39</a>
Alternative languages
Result language
angličtina
Original language name
Herbrand Theorems for Substructural Logics
Original language description
Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand andSkolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classes of 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/GAP202%2F10%2F1826" target="_blank" >GAP202/10/1826: Mathematical Fuzzy Logic in Computer Science</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
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-642-45221-5
ISSN
0302-9743
e-ISSN
—
Number of pages
17
Pages from-to
584-600
Publisher name
Springer
Place of publication
Berlin
Event location
Stellenbosch
Event date
Dec 14, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—