On the methodology of informal rigour: set theory, semantics, and intuitionism

Walter Dean; Hidenori Kurokawa

Home/Archive/arXiv

arXiv · 2104.14887

On the methodology of informal rigour: set theory, semantics, and intuitionism

Walter Dean·Hidenori Kurokawa

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper provides a critical overview of Georg Kreisel's method of informal rigour, most famously presented in his 1967 paper `Informal rigour and completeness proofs'. After first considering Kreisel's own characterization in historical context, we then present two schemas under which we claim his various examples of informal rigour can be subsumed. We then present detailed reconstructions of his three original examples: his squeezing argument in favor of the adequacy of the model theoretic analysis of logical validity, his argument for the determinacy of the Continuum Hypothesis, and his refutation of Markov's principle in intuitionistic analysis. We conclude by offering a comparison of Kreisel's understanding of informal rigour with Carnap's method of explication. In an appendix, we also offer briefer reconstructions of Kreisel's attempts to apply informal rigour to the discovery of set theoretic axioms, the distinction between standard and nonstandard models of arithmetic, and the concepts of finitist proof, predicative definability, and intuitionistic validity.

Explore related subjects

math.LO math.HO

Keep this discovery

BibTeX RIS

Walter Dean, Hidenori Kurokawa. 2021-04-30. On the methodology of informal rigour: set theory, semantics, and intuitionism. https://arxiv.org/abs/2104.14887

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗