Reasoning without believing: on the mechanisation of presuppositions and partiality

DOI10.1080/11663081.2012.705962zbMath1398.03150OpenAlexW1988853459WikidataQ57389367 ScholiaQ57389367MaRDI QIDQ4583173

Michael Kohlhase, Manfred Kerber

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2012.705962

zbMATH Keywords

undefinednessresolution calculusmany-valued logicspresuppositions

Mathematics Subject Classification ID

Logic of natural languages (03B65) Many-valued logic (03B50)

Uses Software

• SPASS
• FLOTTER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A more expressive formulation of many sorted logic
• Unification in sort theories and its applications
• A natural deduction system for discourse representation theory
• A calculus for first order discourse representation structures
• Modular proof systems for partial functions with Evans equality
• On a generalization of quantifiers
• System Description: Spass Version 3.0
• Systematization of finite many-valued logics through the method of tableaux
• Generalized quantifiers and natural language
• Direct deductive computation on discourse representation structures
• SPASS & FLOTTER version 0.42
• A mechanization of strong Kleene logic for partial functions

This page was built for publication: Reasoning without believing: on the mechanisation of presuppositions and partiality