Switch to: References

Citations of:

Hauptsatz for Higher Order Logic

Dag Prawitz

Journal of Symbolic Logic 39 (3):607-607 (1974)

Add citations

You must login to add citations.

The Price of Mathematical Scepticism.Paul Blain Levy - 2022 - Philosophia Mathematica 30 (3):283-305.details This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions. -/- Underlying this argument is the following philosophical view. Mathematical belief springs from certain intuitions, each of which can be either accepted or doubted in its entirety, but not half-accepted. Therefore, our beliefs about reality, bivalence, choice and consistency should all be aligned. Download Export citation Bookmark
Sense and the computation of reference.Reinhard Muskens - 2004 - Linguistics and Philosophy 28 (4):473 - 504.details The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) Download Export citation Bookmark 27 citations
Necessity of Thought.Cesare Cozzo - 2014 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Cham, Switzerland: Springer. pp. 101-20.details The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...) Download Export citation Bookmark 6 citations
Resolution and the consistency of analysis.Peter B. Andrews - 1974 - Notre Dame Journal of Formal Logic 15 (1):73-84.details Download Export citation Bookmark
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.details We give a simple and direct proof that super-consistency implies the cut-elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes ideas from the semantic proofs of cut elimination that proceed by proving the completeness of the cut-free calculus. As an application, we compare our work with the cut-elimination theorems in higher-order logic that involve V-complexes. Download Export citation Bookmark 1 citation
Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.details A semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be payed to cut-simulation, which may render cut-elimination as a pointless criterion. Download Export citation Bookmark 4 citations

1