Axioms of Set Theory

Object x being a member of itself or not and x being a member of R or not constitute two vastly different concepts. This paper attempts to locate the reflection of such an utter difference within the formal structure of the axiom of extensionality. -/- .

We defend a noetic account of intramathematical explanation. On this view, a piece of mathematics is explanatory just in case it produces understanding of an appropriate type. We motivate the view by presenting some appealing features of noeticism. We then discuss and criticize the most prominent extant version of noeticism, due to Inglis and Mejía Ramos, which identifies explanatory understanding with the possession of well-organized cognitive schemas. Finally, we present a novel noetic account. On our view, explanatory understanding arises from (...) meeting specific explanatory objectives. We defend a cluster-concept account of explanatory objectives and identify four important subfamilies within the relevant network of resemblance relations. The resulting view is objectivist (in the sense that it takes explanatory success to be a matter of observer-independent fact), broader in scope than why-question-based accounts, compatible with empirical findings on experts’ explanatory judgments, and capable of generalizing (with appropriate provisos) to scientific explanation as a whole. It thus fulfills Friedman’s half-century-old demand for a general and objectivist theory which accounts for the link between explanation and understanding. (shrink)

According to a widely held view in the philosophy of mathematics, direct inferential justification for mathematical propositions (that are not axioms) requires proof. I challenge this view while accepting that mathematical justification requires arguments that are put forward as proofs. I argue that certain fallacious putative proofs considered by the relevant subjects to be correct can confer mathematical justification. But mathematical justification doesn’t come for cheap: not just any argument will do. I suggest that to successfully transmit justification an argument (...) must satisfy specific standards, some of which are social. I contrast my view with Huemer’s inferential conservatism, which makes mathematical justification too easy to get. Although in this article I focus on mathematical inferential beliefs, the view on offer generalizes to other inferential beliefs. (shrink)

Computational tools might tempt us to renounce complete cer- tainty. By forgoing of rigorous proof, we could get (very) probable results for a fraction of the cost. But is it really true that proofs (as we know and love them) can lead us to certainty? Maybe not. Proofs do not wear their correct- ness on their sleeve, and we are not infallible in checking them. This suggests that we need help to check our results. When our fellow mathematicians will be (...) too tired or too busy to scrutinize our putative proofs, computer proof assistants could help. But feeding a mathematical argument to a computer is hard. Still, we might be willing to undertake the endeavor in view of the extra perks that formalization may bring—chiefly among them, an enhanced mathematical understanding. (shrink)

Paying attention to the inner workings of mathematicians has led to a proliferation of new themes in the philosophy of mathematics. Several of these have to do with epistemology. Philosophers of mathematical practice, however, have not (yet) systematically engaged with general (analytic) epistemology. To be sure, there are some exceptions, but they are few and far between. In this chapter, I offer an explanation of why this might be the case and show how the situation could be remedied. I contend (...) that it is only by conceiving the knowing subject(s) as embodied, fallible, and embedded in a specific context (along the lines of what has been done within social and feminist epistemology) that we can pursue an epistemology of mathematics sensitive to actual mathematical practice. I further suggest that this reconception of the knowing subject(s) does not force us to abandon the traditional framework of epistemology in which knowledge requires justified true belief. It does, however, lead to a fallible conception of mathematical justification that, among other things, makes Gettier cases possible. This shows that topics considered to be far removed from the interests of philosophers of mathematical practice might reveal to be relevant to them. (shrink)

Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions. Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs. In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show that (...) diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability. I then consider whether diagrams can be essential to the proofs in which they appear. (shrink)

The classification of algebraic surfaces by the Italian School of algebraic geometry is universally recognized as a breakthrough in 20th-century mathematics. The methods by which it was achieved do not, however, meet the modern standard of rigor and therefore appear dubious from a contemporary viewpoint. In this article, we offer a glimpse into the mathematical practice of the three leading exponents of the Italian School of algebraic geometry: Castelnuovo, Enriques, and Severi. We then bring into focus their distinctive conception of (...) rigor and intuition. Unlike what is often assumed today, from their perspective, rigor is neither opposed to intuition nor understood as a unitary phenomenon – Enriques distinguishes between small-scale rigor and large-scale rigor and Severi between formal rigor and substantial rigor. Finally, we turn to the notion of mathematical objectivity. We draw from our case study in order to advance a multi-dimensional analysis of objectivity. Specifically, we suggest that various types of rigor may be associated with different conceptions of objectivity: namely, objectivity as faithfulness to facts and objectivity as intersubjectivity. (shrink)

Why do mathematics often give several proofs of the same theorem? This is the question raised in this article, introducing the notion of an epistemic ideal and discussing two such ideals, the explanatoriness and purity of proof.

The aim of this paper is to present a constructive solution to Frege's puzzle (largely limited to the mathematical context) based on type theory. Two ways in which an equality statement may be said to have cognitive significance are distinguished. One concerns the mode of presentation of the equality, the other its mode of proof. Frege's distinction between sense and reference, which emphasizes the former aspect, cannot adequately explain the cognitive significance of equality statements unless a clear identity criterion for (...) senses is provided. It is argued that providing a solution based on proofs is more satisfactory from the standpoint of constructive semantics. (shrink)

¿Qué ha pasado con el problema del cardinal del continuo después de Gödel (1938) y Cohen (1964)? Intentos de responder esta pregunta pueden encontrarse en los artículos de José Alfredo Amor (1946-2011), "El Problema del continuo después de Cohen (1964-2004)", de Carlos Di Prisco , "Are we closer to a solution of the continuum problem", y de Joan Bagaria, "Natural axioms of set and the continuum problem" , que se pueden encontrar en la biblioteca digital de mi blog de Lógica (...) Matemática y Fundamentos de la Matemática (ver). También en la entrada "The Continuum Hypothesis" de la web de Enciclopedia de Filosofía de la Universidad de Stanford existe información importante y actualizada al respecto. En esta breve nota se comenta sobre el tema de una manera divulgativa. (shrink)

The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.

Criteria of acceptability for mathematical proofs are field-dependent. In topology, though not in most other domains, it is sometimes acceptable to appeal to visual intuition to support inferential steps. In previous work :829–842, 2014; Lolli, Panza, Venturi From logic to practice, Springer, Berlin, 2015; Larvor Mathematical cultures, Springer, Berlin, 2016) my co-author and I aimed at spelling out how topological proofs work on their own terms, without appealing to formal proofs which might be associated with them. In this article, I (...) address two criticisms that have been raised in Tatton-Brown against our approach: that it leads to a form of relativism according to which validity is equated with social agreement and that it implies an antiformalizability thesis according to which it is not the case that all rigorous mathematical proofs can be formalized. I reject both criticisms and suggest that our previous case studies provide insight into the plausibility of two related but quite different theses. (shrink)

We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.

This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive methods standardly used in science presuppose that every proposition about the outcome of a chancy process has a certain chance between 0 and 1. I also argue in favour of the standard view that chances are countably additive. Since it is possible to randomly pick (...) out a point on a continuum, for instance using a roulette wheel or by flipping a countable infinity of fair coins, it follows, given the axioms of ZFC, that there are many different cardinalities between countable infinity and the cardinality of the continuum. (shrink)

This paper examines the philosophical significance of the consequence relation defined in the $\Omega$-logic for set-theoretic languages. I argue that, as with second-order logic, the hyperintensional profile of validity in $\Omega$-Logic enables the property to be epistemically tractable. Because of the duality between coalgebras and algebras, Boolean-valued models of set theory can be interpreted as coalgebras. In Section \textbf{2}, I demonstrate how the hyperintensional profile of $\Omega$-logical validity can be countenanced within a coalgebraic logic. Finally, in Section \textbf{3}, the philosophical (...) significance of the characterization of the hyperintensional profile of $\Omega$-logical validity for the philosophy of mathematics is examined. I argue (i) that $\Omega$-logical validity is genuinely logical, and (ii) that it provides a hyperintensional account of formal grasp of the concept of `set'. Section \textbf{4} provides concluding remarks. (shrink)

This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.

ABSTRACT This paper explores the role of aesthetic judgements in mathematics by focussing on the relationship between the epistemic and aesthetic criteria employed in such judgements, and on the nature of the psychological experiences underpinning them. I claim that aesthetic judgements in mathematics are plausibly understood as expressions of what I will call ‘aesthetic-epistemic feelings’ that serve a genuine cognitive and epistemic function. I will then propose a naturalistic account of these feelings in terms of sub-personal processes of representing and (...) assessing the relation between cognitive processes and certain properties of the stimuli at which they are directed. (shrink)

1994.Επιστημολογία της Λογικής. Συγγραφέας Επαμεινώνδας Ξενόπουλος Μοναδική μελέτη και προσέγγιση της θεωρίας της γνώσης, για την παγκόσμια βιβλιογραφία, της διαλεκτικής πορείας της σκέψης από την λογική πλευρά της και της μελλοντικής μορφής που θα πάρουν οι διαλεκτικές δομές της, στην αδιαίρετη ενότητα γνωσιοθεωρίας, λογικής και διαλεκτικής, με την «μέθοδο του διαλεκτικού υλισμού». Έργο βαρύ με θέμα εξαιρετικά δύσκολο διακατέχεται από πρωτοτυπία και ζωντάνια που γοητεύει τον κάθε ανήσυχο στοχαστή από τις πρώτες γραμμές.

Descartes holds that the tell-tale sign of a solid proof is that its entailments appear clearly and distinctly. Yet, since there is a limit to what a subject can consciously fathom at any given moment, a mnemonic shortcoming threatens to render complex geometrical reasoning impossible. Thus, what enables us to recall earlier proofs, according to Descartes, is God’s benevolence: He is too good to pull a deceptive switch on us. Accordingly, Descartes concludes that geometry and belief in God must go (...) hand in hand. However, I argue that, while theism adds a layer of psychological reassurance, the mind-independent reality of God would ensure the preservation of past demonstrations for atheists as well. (shrink)

Bolzano was the first to establish an explicit distinction between the deductive methods that allow us to recognise the certainty of a given truth and those that provide its objective ground. His conception of the relation between what we, in this paper, call "subjective consequence", i.e., the relation from epistemic reason to consequence and "objective consequence", i.e., grounding however allows for an interpretation according to which Bolzano advocates an "explicativist" conception of proof: proofs par excellence are those that reflect the (...) objective order of grounding. In this paper, we expose the problems involved by such a conception and argue in favour of a more rigorous demarcation between the ontological and the epistemological concern in the elaboration of a theory of demonstration. (shrink)

Many mathematicians have cited depth as an important value in their research. However, there is no single widely accepted account of mathematical depth. This article is an attempt to bridge this gap. The strategy is to begin with a discussion of Szemerédi's theorem, which says that each subset of the natural numbers that is sufficiently dense contains an arithmetical progression of arbitrary length. This theorem has been judged deep by many mathematicians, and so makes for a good case on which (...) to focus in analyzing mathematical depth. After introducing the theorem, four accounts of mathematical depth will be considered. (shrink)

REVIEW OF: Automated Development of Fundamental Mathematical Theories by Art Quaife. (1992: Kluwer Academic Publishers) 271pp. Using the theorem prover OTTER Art Quaife has proved four hundred theorems of von Neumann-Bernays-Gödel set theory; twelve hundred theorems and definitions of elementary number theory; dozens of Euclidean geometry theorems; and Gödel's incompleteness theorems. It is an impressive achievement. To gauge its significance and to see what prospects it offers this review looks closely at the book and the proofs it presents.

Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully formalized and, further, that any formal system containing a modicum of number or set theory cannot establish its own consistency. Wilfried Sieg and Clinton Field, in their paper Automated Search for Gödel's Proofs, presented automated proofs of Gödel's theorems at an abstract axiomatic level; they used an appropriate expansion of the strategic considerations that guide the search of the automated theorem prover AProS. The representability conditions that allow the (...) syntactic notions of the metalanguage to be represented inside the object language were taken as axioms in the automated proofs. The concrete task I am taking on in this project is to extend the search by formally verifying these conditions. Using a formal metatheory defined in the language of binary trees, the syntactic objects of the metatheory lend themselves naturally to a direct encoding in Zermelo's theory of sets. The metatheoretic notions can then be inductively defined and shown to be representable in the object-theory using appropriate inductive arguments. Formal verification of the representability conditions is the first step towards an automated proof thereof which, in turn, brings the automated verification of Gödel's theorems one step closer to completion. (shrink)

In this chapter we introduce concepts for analyzing proofs, and for analyzing undergraduate and beginning graduate mathematics students’ proving abilities. We discuss how coordination of these two analyses can be used to improve students’ ability to construct proofs. -/- For this purpose, we need a richer framework for keeping track of students’ progress than the everyday one used by mathematicians. We need to know more than that a particular student can, or cannot, prove theorems by induction or contradiction or can, (...) or cannot, prove certain theorems in beginning set theory or analysis. It is more useful to describe a student’s work in terms of a finer-grained framework that includes various smaller abilities that contribute to proving and that can be learned in differing ways and at differing periods of a student’s development. (shrink)

It is often supposed that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) if a mathematical (...) hypothesis is absolutely undecidable, then it is indeterminate. I shall argue that on no understanding of absolute undecidability could one hope to establish all of (a)–(c). However, I will identify one understanding of absolute undecidability on which one might hope to establish both (a) and (c) to the exclusion of (b). This suggests that a new style of mathematical antirealism deserves attention—one that does not depend on familiar epistemological or ontological concerns. The key idea behind this view is that typical mathematical hypotheses are indeterminate because they are relevantly similar to CH. (shrink)

Mathematical instrumentalism construes some parts of mathematics, typically the abstract ones, as an instrument for establishing statements in other parts of mathematics, typically the elementary ones. Gödel’s second incompleteness theorem seems to show that one cannot prove the consistency of all of mathematics from within elementary mathematics. It is therefore generally thought to defeat instrumentalisms that insist on a proof of the consistency of abstract mathematics from within the elementary portion. This article argues that though some versions of mathematical instrumentalism (...) are defeated by Gödel’s theorem, not all are. By considering inductive reasons in mathematics, we show that some mathematical instrumentalisms survive the theorem. (shrink)

Many results in logic and mathematics rely on techniques that allow for concrete, often visual, representations of abstract concepts. A primary example of this phenomenon in logic is the distinction between syntax and semantics, itself an example of the more general duality in mathematics between algebra and geometry. Such representations, however, often rely on the existence of certain maximal objects having particular properties such as points, possible worlds or Tarskian first-order structures. -/- This dissertation explores an alternative to such representations (...) known as possibility semantics. Its core idea is to replace maximal objects with ordered systems of partial approximations. Although it originates in the semantics of modal logic and the representation of abstract ordered structures, I argue that it has far-reaching mathematical, foundational and philosophical significance, especially in the context of semiconstructive mathematics, a foundational framework that does not assume any fragment of the Axiom of Choice beyond the Axiom of Dependent Choices. -/- The dissertation is divided in two main parts. The first part explores various applications of the mathematical framework underlying possibility semantics to lattice theory and non-classical propositional logics. A major theme is the development of constructive dualities for various categories of lattices, which are related to standard non-constructive dualities via Vietoris constructions. -/- The second part of the dissertation explores the alternative foundational setting of semi-constructive mathematics, focusing on three applications of possibility semantics for classical first-order logic to the philosophy of the mathematical infinite. In particular, we introduce generic powers, a semi-constructive analogue of ultrapowers in classical model theory, and we explore the merits of these structures from a foundational, conceptual and historical viewpoint. (shrink)

One prominent criticism of the abstractionist program is the so-called Bad Company objection. The complaint is that abstraction principles cannot in general be a legitimate way to introduce mathematical theories, since some of them are inconsistent. The most notorious example, of course, is Frege’s Basic Law V. A common response to the objection suggests that an abstraction principle can be used to legitimately introduce a mathematical theory precisely when it is stable: when it can be made true on all sufficiently (...) large domains. In this paper, we raise a worry for this response to the Bad Company objection. We argue, perhaps surprisingly, that it requires very strong assumptions about the range of the second-order quantifiers; assumptions that the abstractionist should reject. (shrink)

Emile Borel regards the Banach-Tarski Paradox as a reductio ad absurdum of the Axiom of Choice. Peter Forrest instead blames the assumption that physical space has a similar structure as the real numbers. This paper argues that Banach and Tarski's result is not paradoxical and that it merely illustrates a surprising feature of the continuum: dividing a spatial region into disjoint pieces need not preserve volume.

Chains of causes appear when the existence of God is discussed. It is claimed by some that these chains must be finite and terminated by God. But these chains seem endless through our knowledge search. This endlessness for the physical reasons for any world event expresses the greatness and complexity of God’s creation and so the transcendence of God. So, only we can put our hands on physical reasons in an endless forage for knowledge. Yet, the endlessness of the physical (...) causes chains confirms the existence of God, and this is what our paper tries using Zorn’s lemma, an equivalent for one of the most celebrated axioms of mathematics, the Axiom of Choice. (shrink)

The paper discusses Hilbert mathematics, a kind of Pythagorean mathematics, to which the physical world is a particular case. The parameter of the “distance between finiteness and infinity” is crucial. Any nonzero finite value of it features the particular case in the frameworks of Hilbert mathematics where the physical world appears “ex nihilo” by virtue of an only mathematical necessity or quantum information conservation physically. One does not need the mythical Big Bang which serves to concentrate all the violations of (...) energy conservation in a “safe”, maximally remote point in the alleged “beginning of the universe”. On the contrary, an omnipresent and omnitemporal medium obeying quantum information conservation rather than energy conservation permanently generates action and thus the physical world. The utilization of that creation “ex nihilo” is accessible to humankind, at least theoretically, as long as one observes the physical laws, which admit it in their new and wider generalization. One can oppose Hilbert mathematics to Gödel mathematics, which can be identified as all the standard mathematics until now featureable by the Gödel dichotomy of arithmetic to set theory: and then, “dialectic”, “intuitionistic”, and “Gödelian” mathematics within the former, according to a negative, positive, or zero value of the distance between finiteness and infinity. A mapping of Hilbert mathematics into pseudo-Riemannian space corresponds, therefore allowing for gravitation to be interpreted purely mathematically and ontologically in a Pythagorean sense. Information and quantum information can be involved in the foundations of mathematics and linked to the axiom of choice or alternatively, to the field of all rational numbers, from which the pair of both dual and anti-isometric Peano arithmetics featuring Hilbert arithmetic are immediately inferable. Noether’s theorems (1918) imply quantum information conservation as the maximally possible generalization of the pair of the conservation of a physical quantity and the corresponding Lie group of its conjugate. Hilbert mathematics can be interpreted from their viewpoint also after an algebraic generalization of them. Following the ideas of Noether’s theorem (1918), locality and nonlocality can be realized both physically and mathematically. The “light phase of the universe” can be linked to the gap of mathematics and physics in the Cartesian organization of cognition in Modernity and then opposed to its “dark phase”, in which physics and mathematics are merged. All physical quantities can be deduced from only mathematical premises by the mediation of the most fundamental physical constants such as the speed of light in a vacuum, the Planck and gravitational constants once they have been interpreted by the relation of locality and nonlocality. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set theory. (...) Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

Para matemáticos interesados en problemas de fundamentos, lógico-matemáticos y filósofos de la matemática, el axioma de elección es centro obligado de reflexión, pues ha sido considerado esencial en el debate dentro de las posiciones consideradas clásicas en filosofía de la matemática (intuicionismo, formalismo, logicismo, platonismo), pero también ha tenido una presencia fundamental para el desarrollo de la matemática y metamatemática contemporánea. Desde una posición que privilegia el quehacer matemático, nos proponemos mostrar los aportes que ha tenido el axioma en varias (...) áreas fundamentales de la matemática, su aplicación en la lógica de primer orden, así como una breve descripción de las pruebas de consistencia relativa debidas a Gödel y Cohen, las cuales establecieron su independencia del sistema axiomático Zermelo-Fraenkel (ZF). Con todo lo anterior mostraremos cómo el quehacer matemático contemporáneo se adscribe al platonismo matemático en los términos de Bernays y Ferreirós. Revisaremos también los argumentos de Zermelo y Cantor para permitir el uso de asunciones en la matemática, los cuales se acercan a los planteamientos de la investigación científica y esbozan relaciones con la filosofía de la práctica matemática. Finalmente, justificamos el uso del axioma de elección en la contemporaneidad, abogando por unas relaciones de equidad entre la matemática y la filosofía, presentando además su plena vigencia, a través de la referencia a algunos problemas abiertos en la actualidad que vinculan el axioma de elección con la teoría de Ramsey. (shrink)

Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by quantum neo-Pythagoreanism links (...) it to the opposition of propositional logic, to which Gentzen’s cut rule refers immediately, on the one hand, and the linguistic and mathematical theory of metaphor therefore sharing the same structure borrowed from Hilbert arithmetic in a wide sense. An example by hermeneutical circle modeled as a dual pair of a syllogism (accomplishable also by a Turing machine) and a relevant metaphor (being a formal and logical mistake and thus fundamentally inaccessible to any Turing machine) visualizes human understanding corresponding also to Gentzen’s cut elimination and the Gödel dichotomy about the relation of arithmetic to set theory: either incompleteness or contradiction. The metaphor as the complementing “half” of any understanding of hermeneutical circle is what allows for that Gödel-like incompleteness to be overcome in human thought. (shrink)

In this paper, I critically examine Kurt Gödel’s argument against the syntactic interpretation of mathematics. While the main aim is to analyze the argument, I also wish to underscore the relevance of the original elements of Gödel’s philosophical thought. The paper consists of four parts. In the first part, I introduce the reader to Gödel’s philosophy. In the second part, I reconstruct the formalist stance in the philosophy of mathematics, which is the object of Gödel’s criticism. In the third part, (...) I sketch his argument against the syntactic interpretation of mathematics. Finally, I discuss some controversies regarding the argument. (shrink)

En el ámbito de la lógica matemática existe un problema sobre la relación lógica entre dos versiones débiles del Axioma de elección (AE) que no se ha podido resolver desde el año 2000 (aproximadamente). Tales versiones están relacionadas con ultrafiltros no principales y con Propiedades Ramsey (Bernstein, Polarizada, Subretículo, Ramsey, Ordinales flotantes, etc). La primera versión débil del AE es la siguiente (A): “Existen ultrafiltros no principales sobre el conjunto de los números naturales (ℕ)”. Y la segunda versión débil del (...) AE es la siguiente (B): “Existen ultraflitros sobre ℕ”. Se sabe que A implica B, pero se desconoce si B implica A. Di Prisco y Henle conjeturan en los artículos ([1], [2]) que esto no ocurre, es decir, conjeturan que B no implica A, en otras palabras, conjeturan que A es más fuerte estrictamente que B, que A es independiente de B, pero esto no se ha podido demostrar todavía aunque se ha intentado hacer desde hace aproximadamente 21 años. Una descripción detallada de este problema abierto puede encontrarse en esta ponencia (dictada en el marco del Día Mundial de la Lógica 14-01-2022) y en el artículo [3]. [1] C. Di Prisco y H. Henle. “Doughnuts, Floating Ordinals, Square Brackets, and Ultraflitters”. Journal of Symbolic Logic 65 (2000) 462-473. [2] C. Di Prisco y H. Henle. “Partitions of the reals and choice”. En “Models, algebras and proofs”. X. Caicedo y C.M. Montenegro. Eds. Lecture Notes in Pure and Appl. Math, 203, Marcel Dekker, 1999. [3] F. Galindo. “Tópicos de ultrafiltros”. Divulgaciones Matemáticas. Vol. 21, No 1-2, 2020. (shrink)

This article’s objetive is to present four application examples of Herbrand’s theorem to decide the validity of reasoning on first order language, in accordance whit Church’s Undecidability’s theorem. Also, to tell which is the principal problem around it. The logical resolution calculus will be worked on this article, which is a method used in artificial intelligence.

En este artículo realizamos una reconstrucción del Programa original de Hilbert antes del surgimiento de los teoremas limitativos de la tercera década del siglo pasado. Para tal reconstrucción empezaremos por mostrar lo que Torretti llama los primeros titubeos formales de Hilbert, es decir, la defensa por el método axiomático como enfoque fundamentante. Seguidamente, mostraremos como estos titubeos formales se establecen como un verdadero programa de investigación lógico-matemático y como dentro de dicho programa la inquietud por la decidibilidad de los problemas (...) matemáticos y en específico la decidibilidad de la Lógica de primer orden cobra peso. Luego pasamos a analizar como la inquietud por la decibilidad toma lugar dentro del pensamiento filosófico-matemático de Hilbert presentándose como uno de los grandes problemas a los cuales la metamatemática debe encontrar una solución, esto lo hacemos mostrando un contraste con autores, como John von Neumann y Roberto Torretti, quienes de alguna u otra manera no interpretan el problema de la decidibilidad de la Lógica de primer orden como un problema de peso dentro del programa original de Hilbert. Finalmente argumentamos que el resultado meta-teórico de Church puede entenderse como una refutación del optimismo intelectual que permea a todo el programa original de Hilbert. (shrink)

El objetivo de este trabajo es presentar en un solo cuerpo tres maneras de relativizar (o generalizar) el concepto de conjunto constructible de Gödel que no suelen aparecer juntas en la literatura especializada y que son importantes en la Teoría de Conjuntos, por ejemplo para resolver problemas de consistencia o independencia. Presentamos algunos modelos resultantes de las diferentes formas de relativizar el concepto de constructibilidad, sus propiedades básicas y algunas formas débiles del Axioma de Elección válidas o no válidas en (...) ellas. (shrink)

We study several perfect set properties of the Baire space which follow from the Ramsey property ω→(ω) ω . In particular we present some independence results which complete the picture of how these perfect set properties relate to each other.

El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...) Dedekind siguiendo el texto “Set Theory” de Jech, y otras ideas propias del autor de este artículo. Adicionalmente, se formulan algunas versiones débiles del axioma de elección relacionadas con las álgebras booleanas, las cuales son también de gran importancia para la investigación en teoría de conjuntos y teoría de modelos, pues estas son poderosas técnicas de construcción de modelos, como por ejemplo, el teorema de compacidad (permite construir modelos no estándar, etc) y el teorema del ultrafiltro, que permite construir ultraproductos (pueden ser usados para investigar problemas de cardinales grandes, etc). Se presentan algunas referencias de problemas abiertos sobre el tema. -/- The objective of this paper is to present a demonstration of a classical theorem on boolean algebras and partial orders of current relevance in set theory, as for example, for applications of model construction method called forcing" (with boolean algebras complete or with partial orders). The theorem to be proved is as follows: Any partial order can be extended to a single complete boolean algebra (up to isomorphism)". Where to extend means embed densely". Such a demonstration is done using Dedekind's cuts following the text Set Theory" of Jech, and other ideas of the author of this article. In addition, some weak versions of the axiom of choice related to boolean algebras are formulated, which are also of great importance for the research in set theory and model theory, since this are powerful model construction techniques, such as the compactness theorem (allows the construction of non-standard models, etc.) and the ultralter theorem, which allows the construction of ultraproducts (can be used to investigate problems of large cardinals, etc). Some references of open problems on the subject are presented. (shrink)

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...) = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and loss (...) of information, the concept of arithmetic logical entropy can be used. The Turing machine and its equivalent, general recursive functions can be understood through the λ calculus and the Turing/Church thesis. However, there are certain recursive functions that cannot be fully understood or predicted by other algorithms due to the loss of information during logical-arithmetic operations. In other words, the behaviour of these functions cannot be completely determined at every stage of the computation due to a lack of information in their definition. While there are some cases where the behaviour of recursive functions is highly predictable, the lack of information in most cases makes it impossible for algorithms to determine if a program will halt or not. This inability to predict the outcome of the computation is the essence of the halting problem of the Turing machine. Even in cases where more information is available about the program, it is still difficult to determine with certainty if the program will halt or not. This also highlights the importance of the Turing oracle machine, which introduces information from outside the computation to compensate for the lack of information and ultimately decide the result of the computation. (shrink)