16TaP: A Toy Tableau Theorem Prover for 16-Valued Trilattice Logics

A Programming Road to Logic, Maths, Language, and Philosophy : A Tribute to Jan van Eijck on the Occasion of His Retirement (2017)
  Copy   BIBTEX

Abstract

A short description of a toy theorem prover for 16-valued trilattice logics. Written for the occasion of my friend's Jan van Eijck's retirement. With a link to a swish interface to the prolog prover.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

How to avoid the formal verification of a theorem prover.A. Avellone, M. Benini & U. Moscato - 2001 - Logic Journal of the IGPL 9 (1):1-25.
Theorem Proving and Model Building with the Calculus KE.Jeremy Pitt & Jim Cunningham - 1996 - Logic Journal of the IGPL 4 (1):129-150.
Theorem proving for untyped constructive λ-calculus: implementation and application.A. Ramsay - 2001 - Logic Journal of the IGPL 9 (1):83-100.
Systematization of finite many-valued logics through the method of tableaux.Walter A. Carnielli - 1987 - Journal of Symbolic Logic 52 (2):473-493.
Omitting uncountable types and the strength of [0,1]-valued logics.Xavier Caicedo & José N. Iovino - 2014 - Annals of Pure and Applied Logic 165 (6):1169-1200.
Effective finite-valued approximations of general propositional logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron & Nachum Dershowitz (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag. pp. 107–129.
Automated theorem proving for łukasiewicz logics.Gordon Beavers - 1993 - Studia Logica 52 (2):183 - 195.
Many-valued reflexive autoepistemic logic.C. Koutras & S. Zachos - 2000 - Logic Journal of the IGPL 8 (1):33-54.
Lógicas multivalentes. Uma introdução matemática e computacional.Luis M. Augusto - 2016 - Dissertation, Universidade Aberta
Maximality in finite-valued Lukasiewicz logics defined by order filters.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - 2019 - Journal of Logic and Computation 29 (1):125-156.
System description: { A higher-order theorem prover?Michael Kohlhase - manuscript
Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
Interest driven suppositional reasoning.John Pollock - manuscript
KAT-ML: an interactive theorem prover for Kleene algebra with tests.Kamal Aboul-Hosn & Dexter Kozen - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):9-33.
Automated Reasoning for Conditional Logics: the Theorem Prover Condlean 3.1.Nicola Olivetti & Gian Luca Pozzato - 2007 - In Jean-Yves Béziau & Alexandre Costa-Leite (eds.), Perspectives on Universal Logic.

Analytics

Added to PP
2018-08-26

Downloads
15 (#943,292)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Reinhard Muskens
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references