Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic

&
Logic and Logical Philosophy 25 (4):535-554 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,369

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

Embedding and Automating Conditional Logics in Classical Higher-Order Logic.Christoph Benzmüller, Dov Gabbay, Valerio Genovese & Daniele Rispoli - 2012 - Annals of Mathematics and Artificial Intelligence 66 (1-4):257-271.
Combining and Automating Classical and Non-Classical Logics in Classical Higher-Order Logic.Christoph Benzmüller - 2011 - Annals of Mathematics and Artificial Intelligence) 62 (1-2):103-128.
Verifying the Modal Logic Cube is an Easy Task.Christoph Benzmüller - 2010 - In Simon Siegler & Nathan Wasser (eds.), Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th Birthday. Springer. pp. 117-128.
Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.
Computer-Assisted Analysis of the Anderson-Hájek Controversy.Benzmüller Christoph, Weber Leon & Woltzenlogel Paleo Bruno - 2017 - Logica Universalis 11 (1):139-151.
Analysis of an Ontological Proof Proposed by Leibniz.Matthias Bentert, Christoph Benzmüller, David Streit & Bruno Woltzenlogel Paleo - 2016 - In Charles Tandy (ed.), Death and Anti Death, vol. 14: Four Decades after Michael Polanyi, Three Centuries after G. W. Leibniz. RIA University Press.
Higher-order semantics and extensionality.Christoph Benzmüller, Chad E. Brown & Michael Kohlhase - 2004 - Journal of Symbolic Logic 69 (4):1027-1088.
Embedding Friendly First-Order Paradefinite and Connexive Logics.Norihiro Kamide - 2022 - Journal of Philosophical Logic 51 (5):1055-1102.
Combined reasoning by automated cooperation.Christoph Benzmüller, Volker Sorge, Mateja Jamnik & Manfred Kerber - 2008 - Journal of Applied Logic 6 (3):318-342.
Multimodal and intuitionistic logics in simple type theory.Christoph Benzmueller & Lawrence Paulson - 2010 - Logic Journal of the IGPL 18 (6):881-892.

Analytics

Added to PP
2017-12-04

Downloads
20 (#1,046,673)

6 months
4 (#1,263,115)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Christoph Benzmueller
Freie Universität Berlin

Citations of this work

Add more citations

References found in this work

How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
A formulation of the simple theory of types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):56-68.
Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
A Formulation of the Simple Theory of Types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (3):114-115.
A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.

View all 16 references / Add more references