Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Toward the Formulation of Presupposition by Illative Combinatory Logic
verfasst von : Yuri Ishishita, Daisuke Bekki
Erschienen in: Logical Aspects of Computational Linguistics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Model-theoretic semantics, which originates with Tarski, and proof-thoretic semantics, which originates with Gentzen, are two views in semantics of logic that are distinct from but closely related to each other. Each has advantages over the other in investigating a certain aspect of logic, and it is more or less commonly accepted that rather than being a matter of methodological choice, utilizing them gives us diversified standpoints on various issues. A good example of this is the two proofs of the consistency of LK: one proof is based on soundness and the other on cut-elimination, which makes use of different resources but also together reveals what the consistency of predicate calculus indeed depends on.