Variations on a thesis: intuitionism and computability

  title={Variations on a thesis: intuitionism and computability},
  author={Charles McCarty},
  journal={Notre Dame J. Formal Log.},
  • C. McCarty
  • Published 1 October 1987
  • Philosophy
  • Notre Dame J. Formal Log.
There are three variations. The first is an extended argument for a reappraisal of the status of CT within intuitionism. Traditionally, the intuitionists' attitude toward CT has been strongly negative; it was thought that Church's Thesis was obviously false. The fact that it is consistent with the main bulk of constructive mathematics was either to be deplored or ignored. We think this attitude unfortunate. As it seems to derive a good part of its impetus from an unnecessary identification of… 
Structures and Logics: A Case for (a) Relativism
In this paper, I use the cases of intuitionistic arithmetic with Church’s thesis, intuitionistic analysis, and smooth infinitesimal analysis to argue for a sort of pluralism or relativism about
Nonstandard Functional Interpretations and Categorical Models
This work introduces a variant of the Diller–Nahm interpretation with two different kinds of quantifiers, similar to Hernest’s light Dialectica interpretation, and shows that one can obtain nonstandarddialectica by weakening the computational content of the existential quantifiers—a process called herbrandization.
A simple computational interpretation of set theory
CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article
Philosophy of Mind Is (in Part) Philosophy of Computer Science
The link between the issues identified in philosophy of mind and philosophy of computer science is used to respond to a prominent argument against the possibility of building a machine that passes the Turing test.
Structure and Categoricity: Determinacy of Reference and Truth-Value in the Philosophy of Mathematics
This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity
J an 2 01 3 Realizability with a Local Operator of
We study a notion of realizability with a local operator J which was first considered by A.M. Pitts in his thesis [7]. Using the Suslin-Kleene theorem, we show that the representable functions for
The Herbrand topos
We define a new topos, the Herbrand topos, inspired by the modified realizability topos and our earlier work on Herbrand realizability. We also introduce the category of Herbrand assemblies and
Philosophy of mathematics
ion. Resnik follows Quine in holding that both mathematical and physical entities are postulated, and their existence is justified on holistic grounds. A detailed contrast between abstraction and
Basic subtoposes of the effective topos
Transcription in maize mitochondria: effects of tissue and mitochondrial genotype
The results indicate not only that promoter strength is an important component of the regulation of transcript levels in maize mitochondria, but also that the strength of a specific gene promoter can be dependent on the cytoplasmic genotype.


The Philosophical Basis of Intuitionistic Logic
On the Interpretation of Intuitionistic Number Theory
It is proposed to regard the generality statement as an incomplete communication of a more specific statement, namely of one which gives an effective general method for obtaining, to any particular value of n, the information implicit in the assertion that that n has the property P.
Constructive validity is nonarithmetic
  • C. McCarty
  • Mathematics
    Journal of Symbolic Logic
  • 1988
It follows constructively from weak versions of Markov's principle and Church's thesis that logical validity for single sentences is not arithmetically definable and is a direct consequence of the constructive modeltheoretic fact that one can prove the categoricity of first-order Heyting arithmetic.
Extending Gödel's negative interpretation to ZF
  • W. Powell
  • Mathematics, Philosophy
    Journal of Symbolic Logic
  • 1975
It is shown that Godel's negative interpretation can be extended to Zermelo-Fraenkel set theory and an inner model S is defined in which the axioms of Zermel- FraenkelSet theory are true.
On the Very Idea of a Conceptual Scheme
Philosophers of many persuasions are prone to talk of conceptual schemes. Conceptual schemes, we are told, are ways of organizing experience; they are systems of categories that give form to the data
Markov's principle, isols and Dedekind finite sets
  • C. McCarty
  • Mathematics
    Journal of Symbolic Logic
  • 1988
MPS is tantamount, in constructive mathematics, to the standard classical characterizations of ⊿ in terms of cardinality, and simple closure properties on the Dedekind finite sets provide ready examples of statements which are strictly weaker than Markov's principle and yet are independent of extensions of IZF.
Skolem's paradox and constructivism
Les AA. soutiennent que les mathematiques intuitionnistes ne donnent pas lieu au paradoxe de Skolem. Ils soutiennent de plus que les preuves connues du theoreme de Lowenheim-Skolem sont inacceptables
Data Types as Lattices
The meaning of many kinds of expressions in programming languages can be taken as elements of certain spaces of “partial” objects. In this report these spaces are modeled in one universal domain
Proofs and the Meaning and Completeness of the Logical Constants
In this lecture I shall discuss the notions of meaning and proof and how they depend on each other. In conclusion, I shall deal with the question of the completeness of the usual sentential