- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Counting proofs in propositional logic
Archive for Mathematical Logic 48 (2):185-199 (2009)
Abstract
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infiniteLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Some remarks on lengths of propositional proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
Propositional logic of continuous transformations in Cantor space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.
Upper bounds on complexity of Frege proofs with limited use of certain schemata.Pavel Naumov - 2006 - Archive for Mathematical Logic 45 (4):431-446.
Euler's?-function in the context of I? 0.Marc Jumelet - 1995 - Archive for Mathematical Logic 34 (3):197-209.
Euler'sϕ-function in the context of IΔ 0.Marc Jumelet - 1995 - Archive for Mathematical Logic 34 (3):197-209.
On undecidability of the propositional logic of an associative binary modality.Michael Kaminski - forthcoming - Archive for Mathematical Logic:1-21.
Euler's $\varphi$ -function in the context of ${\rm I}\Delta_0$.Marc Jumelet - 1995 - Archive for Mathematical Logic 34 (3):197-209.
Cut elimination by unthreading.Gabriele Pulcini - 2023 - Archive for Mathematical Logic 63 (1):211-223.
A semantical proof of the strong normalization theorem for full propositional classical natural deduction.Karim Nour & Khelifa Saber - 2006 - Archive for Mathematical Logic 45 (3):357-364.
Analytics
Added to PP
2013-11-23
Downloads
70 (#228,098)
6 months
4 (#1,005,419)
2013-11-23
Downloads
70 (#228,098)
6 months
4 (#1,005,419)
Historical graph of downloads
Citations of this work
A coinductive approach to proof search through typed lambda-calculi.José Espírito Santo, Ralph Matthes & Luís Pinto - 2021 - Annals of Pure and Applied Logic 172 (10):103026.
References found in this work
Basic proof theory.A. S. Troelstra - 1996 - New York: Cambridge University Press. Edited by Helmut Schwichtenberg.
Strong normalization of classical natural deduction with disjunctions.Koji Nakazawa & Makoto Tatsuta - 2008 - Annals of Pure and Applied Logic 153 (1-3):21-37.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-kkm7k uwo