A note on extensions: Admissible rules via semantics

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

Any intermediate logic with the disjunction property admits the Visser rules if and only if it has the extension property. This equivalence restricts nicely to the extension property up to n. In this paper we demonstrate that the same goes even when omitting the rule ex falso quod libet, that is, working over minimal rather than intuitionistic logic. We lay the groundwork for providing a basis of admissibility for minimal logic, and tie the admissibility of the Mints-Skura rule to the extension property in a stratified manner.

LanguageEnglish
Title of host publicationLogical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings
Pages206-218
Number of pages13
DOIs
Publication statusPublished - 1 Dec 2013
EventInternational Symposium on Logical Foundations of Computer Science, LFCS 2013 - San Diego, CA, United States
Duration: 6 Jan 20138 Jan 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7734 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Symposium on Logical Foundations of Computer Science, LFCS 2013
CountryUnited States
CitySan Diego, CA
Period6/01/138/01/13

Fingerprint

Mints
Admissible Rule
Semantics
Admissibility
Intermediate Logics
Intuitionistic Logic
Tie
Equivalence
Logic
If and only if
Demonstrate

Keywords

  • Admissible rules
  • Disjunction property
  • Extensions of Kripke models
  • Minimal logic

Cite this

Goudsmit, J. (2013). A note on extensions: Admissible rules via semantics. In Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings (pp. 206-218). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7734 LNCS). https://doi.org/10.1007/978-3-642-35722-0_15
Goudsmit, Jeroen. / A note on extensions : Admissible rules via semantics. Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. 2013. pp. 206-218 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{641d1a52e92f420c8dcc11c68644294a,
title = "A note on extensions: Admissible rules via semantics",
abstract = "Any intermediate logic with the disjunction property admits the Visser rules if and only if it has the extension property. This equivalence restricts nicely to the extension property up to n. In this paper we demonstrate that the same goes even when omitting the rule ex falso quod libet, that is, working over minimal rather than intuitionistic logic. We lay the groundwork for providing a basis of admissibility for minimal logic, and tie the admissibility of the Mints-Skura rule to the extension property in a stratified manner.",
keywords = "Admissible rules, Disjunction property, Extensions of Kripke models, Minimal logic",
author = "Jeroen Goudsmit",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/978-3-642-35722-0_15",
language = "English",
isbn = "9783642357213",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "206--218",
booktitle = "Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings",

}

Goudsmit, J 2013, A note on extensions: Admissible rules via semantics. in Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7734 LNCS, pp. 206-218, International Symposium on Logical Foundations of Computer Science, LFCS 2013, San Diego, CA, United States, 6/01/13. https://doi.org/10.1007/978-3-642-35722-0_15

A note on extensions : Admissible rules via semantics. / Goudsmit, Jeroen.

Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. 2013. p. 206-218 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7734 LNCS).

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - A note on extensions

T2 - Admissible rules via semantics

AU - Goudsmit, Jeroen

PY - 2013/12/1

Y1 - 2013/12/1

N2 - Any intermediate logic with the disjunction property admits the Visser rules if and only if it has the extension property. This equivalence restricts nicely to the extension property up to n. In this paper we demonstrate that the same goes even when omitting the rule ex falso quod libet, that is, working over minimal rather than intuitionistic logic. We lay the groundwork for providing a basis of admissibility for minimal logic, and tie the admissibility of the Mints-Skura rule to the extension property in a stratified manner.

AB - Any intermediate logic with the disjunction property admits the Visser rules if and only if it has the extension property. This equivalence restricts nicely to the extension property up to n. In this paper we demonstrate that the same goes even when omitting the rule ex falso quod libet, that is, working over minimal rather than intuitionistic logic. We lay the groundwork for providing a basis of admissibility for minimal logic, and tie the admissibility of the Mints-Skura rule to the extension property in a stratified manner.

KW - Admissible rules

KW - Disjunction property

KW - Extensions of Kripke models

KW - Minimal logic

UR - http://www.scopus.com/inward/record.url?scp=84892934733&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892934733&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-35722-0_15

DO - 10.1007/978-3-642-35722-0_15

M3 - Conference contribution

SN - 9783642357213

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 206

EP - 218

BT - Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings

ER -

Goudsmit J. A note on extensions: Admissible rules via semantics. In Logical Foundations of Computer Science - International Symposium, LFCS 2013, Proceedings. 2013. p. 206-218. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-35722-0_15