A probabilistic machine for the estimation of provability in the first order predicate calculus

Mathematical Logic Quarterly 15 (19):291-297 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19690151902

Links

PhilArchive



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

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

The statistical estimation of provability in the first order predicate calculus.S. Christiaan van Westrhenen - 1969 - [Eindhoven,: Technische Hogeschool (Inslindelaan 2).
Some remarks on the statistical estimation of probability in first-order predicate calculus.S. C. van Westrhenen - 1968 - In P. Braffort & F. van Scheepen (eds.), Automation in language translation and theorem proving. Brussels,: Commission of the European Communities, Directorate-General for Dissemination of Information.
Realization of Intuitionistic Logic by Proof Polynomials.Sergei N. Artemov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):285-301.
Complete problems in the first-order predicate calculus.David A. Plaisted - 1979 - Urbana, Ill.: Dept. of Computer Science, University of Illinois at Urbana-Champaign.
Proving theorems of the second order Lambek calculus in polynomial time.Erik Aarts - 1994 - Studia Logica 53 (3):373 - 387.
On predicate provability logics and binumerations of fragments of Peano arithmetic.Taishi Kurahashi - 2013 - Archive for Mathematical Logic 52 (7-8):871-880.
Attributive adjectives and the predicate calculus.Hanoch Ben-Yami - 1996 - Philosophical Studies 83 (3):277 - 289.
A modal calculus analogous to k4w, based on intuitionistic propositional logic, iℴ.Aldo Ursini - 1979 - Studia Logica 38 (3):297 - 311.
On the proof-theory of a first-order extension of GL.Yehuda Schwartz & George Tourlakis - 2014 - Logic and Logical Philosophy 23 (3).
A computer programme for the first order predicate calculus without identity.S. C. van Westrhenen - 1968 - In P. Braffort & F. van Scheepen (eds.), Automation in language translation and theorem proving. Brussels,: Commission of the European Communities, Directorate-General for Dissemination of Information.
A Finitely Axiomatized Formalization of Predicate Calculus with Equality.Norman D. Megill - 1995 - Notre Dame Journal of Formal Logic 36 (3):435-453.
The modal object calculus and its interpretation.Edward N. Zalta - 1997 - In M. de Rijke (ed.), Advances in Intensional Logic. Kluwer Academic Publishers. pp. 249--279.
Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
A new formulation of discussive logic.Jerzy Kotas & N. C. A. Costa - 1979 - Studia Logica 38 (4):429 - 445.
Wittgensteinian Predicate Logic.Kai F. Wehmeier - 2004 - Notre Dame Journal of Formal Logic 45 (1):1-11.

Analytics

Added to PP
2013-12-01

Downloads
11 (#1,137,570)

6 months
2 (#1,198,779)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references