Philosophy of Mathematics

This thesis is devoted to the exploration of the complexity of some mathematical problems using the framework of computable analysis and descriptive set theory. We will especially focus on Weihrauch reducibility as a means to compare the uniform computational strength of problems. After a short introduction of the relevant background notions, we investigate the uniform computational content of problems arising from theorems that lie at the higher levels of the reverse mathematics hierarchy.We first analyze the strength of the open and (...) clopen Ramsey theorems. Since there is not a canonical way to phrase these theorems as multi-valued functions, we identify eight different multi-valued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility.We then discuss some new operators on multi-valued functions and study their algebraic properties and the relations with other previously studied operators on problems. In particular, we study the first-order part and the deterministic part of a problem f, capturing the Weihrauch degree of the strongest multi-valued problem that is reducible to f and that, respectively, has codomain $\mathbb {N}$ or is single-valued.These notions proved to be extremely useful when exploring the Weihrauch degree of the problem $\mathsf {DS}$ of computing descending sequences in ill-founded linear orders. They allow us to show that $\mathsf {DS}$, and the Weihrauch equivalent problem $\mathsf {BS}$ of finding bad sequences through non-well quasi-orders, while being very “hard” to solve, are rather weak in terms of uniform computational strength. We then generalize $\mathsf {DS}$ and $\mathsf {BS}$ by considering $\boldsymbol {\Gamma }$ -presented orders, where $\boldsymbol {\Gamma }$ is a Borel pointclass or $\boldsymbol {\Delta }^1_1$, $\boldsymbol {\Sigma }^1_1$, $\boldsymbol {\Pi }^1_1$. We study the obtained $\mathsf {DS}$ -hierarchy and $\mathsf {BS}$ -hierarchy of problems in comparison with the Baire hierarchy and show that they do not collapse at any finite level.Finally, we work in the context of geometric measure theory and we focus on the characterization, from the point of view of descriptive set theory, of some conditions involving the notions of Hausdorff/Fourier dimension and Salem sets. We first work in the hyperspace $\mathbf {K}$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol {\Pi }^0_3$ -complete family. This is done by characterizing the complexity of the family of sets having sufficiently large Hausdorff or Fourier dimension. We also show that the complexity does not change if we increase the dimension of the ambient space and work in $\mathbf {K}$. We also generalize the results by relaxing the compactness of the ambient space and show that the closed Salem sets are still $\boldsymbol {\Pi }^0_3$ -complete when we endow $\mathbf {F}$ with the Fell topology. A similar result holds also for the Vietoris topology.We conclude by analyzing the same notions from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity, and show that the complexities remain the same also in the lightface case. In particular, we show that the family of all the closed Salem sets is $\Pi ^0_3$ -complete. We furthermore characterize the Weihrauch degree of the functions computing Hausdorff and Fourier dimension of closed sets.Abstract prepared by Manlio Valenti.E-mail:[email protected] (shrink)

The concept of hypodox is dual to the concept of paradox. Whereas a paradox is incompatibly overdetermined, a hypodox is underdetermined. Indeed, many particular paradoxes have dual hypodoxes. So, naively the dual of Russell’s Paradox is whether the set of all sets that are members of themselves is self-membered. The dual of the Liar Paradox is the Truth-teller, and a hypodoxical dual of the Heterological paradox is whether ‘autological’ is autological. I provide some analysis of the duality and I search (...) for modal hypodoxes as duals to known paradoxes. I also try to continue this search further by mapping the relations between some paradoxes and hypodoxes in duality squares. This investigation increases the known extension of the concept of hypodox, and the duality relation between paradoxes and hypodoxes assists in finding some of these. (shrink)

U članku se razmatra grčki ideal mjere, najčešće izražen pojmom sredine. To nije samo svegrčki ideal nego drevna i svevremena baština, koja je konvergirala odgoju u ujednosti ‘dobrote i ljepote’. On je življen u polisu, kao što je bio i personalna, unutarduševna težnja. U Aristotelovoj politici počelo mjere prvenstveno je vezano za balansiranje političkih poredaka, ali postoji i druga perspektiva u kojoj je više riječ o vrlini i moralnim kvalitetama aristokracije, gdje se identificira dobrog čovjeka i građanina. Taj pristup srodniji (...) je istraživanjama u Aristotelovim etičkim tekstovima. Pažljiva analiza ovih distinkcija iz knjige Politika zaključuje se s uvidima o odgoju i vrlini kao komplementarnim aspektima praktičke filozofije. The article considers the Greek ideal of moderation, most often expressed through the notion of the Mean. It is not merely a pangreek ideal, but an ancient and everlasting inheritance, which converged to the education in the unity of ‘goodness and beauty’. It is lived in the polis, as it was also a personal aspiration of the inner soul. In Aristotle’s politics, the source of moderation is primarily connected to the balance of political orders, however there is another perspective in which it is more about the virtue and moral qualities of aristocracy, which identifies the good man and citizen. That approach is more akin to research conducted in Aristotle’s texts on ethics. Careful analysis of these distinctions from the book Politics is concluded with insights on education and virtue as complementary aspects of practical philosophy. (shrink)

In the Zermelo–Fraenkel set theory, $|\textrm {fin}|<2^{|A|}\leq |\textrm {Part}|$ for any infinite set $A$, where $\textrm {fin}$ is the set of finite subsets of $A$, $2^{|A|}$ is the cardinality of the power set of $A$ and $\textrm {Part}$ is the set of partitions of $A$. In this paper, we show in ZF that $|\textrm {fin}|<|\textrm {Part}_{\textrm {fin}}|$ for any set $A$ with $|A|\geq 5$, where $\textrm {Part}_{\textrm {fin}}$ is the set of partitions of $A$ whose members are finite. We also (...) show that, without the Axiom of Choice, any relationship between $|\textrm {Part}_{\textrm {fin}}|$ and $2^{|A|}$ for an arbitrary infinite set $A$ cannot be concluded. (shrink)

The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a subspace (...) of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)

Reverse mathematics is a new take on an old idea: asking which axioms are necessary to prove a given theorem. This question was first asked about the parallel axiom in Euclid’s geometry and later about the axiom of choice in set theory. Obviously, such questions can be asked in many fields of mathematics, but in recent decades, it has proved fruitful to focus on subsystems of second-order arithmetic, where much of mainstream mathematics resides. It has been found that many basic (...) theorems of analysis and topology, as well as certain parts of infinite algebra and combinatorics, can be proved in such systems. And, remarkably, almost all the basic theorems fall into one of five particular systems: a base system RCA0 of “constructive mathematics” and four others defined by certain axioms about real numbers. Moreover, many of the theorems not provable in RCA0 turn out to be equivalent to one of these defining axioms, so we know precisely which axiom is needed to prove them. Thus, after some motivational remarks about the parallel axiom and the axiom of choice, we will concentrate on the study of RCA0 and its extensions, which is what “reverse mathematics” is generally taken to mean today. (shrink)

For scatterplots with gaussian distributions of dots, the perception of Pearson correlation r can be described by two simple laws: a linear one for discrimination, and a logarithmic one for perceived magnitude (Rensink & Baldridge, 2010). The underlying perceptual mechanisms, however, remain poorly understood. To cast light on these, four different distributions of datapoints were examined. The first had 100 points with equal variance in both dimensions. Consistent with earlier results, just noticeable difference (JND) was a linear function of the (...) distance away from r = 1, and the magnitude of perceived correlation a logarithmic function of this quantity. In addition, these laws were linked, with the intercept of the JND line being the inverse of the bias in perceived magnitude. Three other conditions were also examined: a dot cloud with 25 points, a horizontal compression of the cloud, and a cloud with a uniform distribution of dots. Performance was found to be similar in all conditions. The generality and form of these laws suggest that what underlies correlation perception is not a geometric structure such as the shape of the dot cloud, but the shape of the probability distribution of the dots, likely inferred via a form of ensemble coding. It is suggested that this reflects the ability of observers to perceive the information entropy in an image, with this quantity used as a proxy for Pearson correlation. (shrink)

Mainstream philosophy of mathematics, namely the philosophy of mathematics that has prevailed for the past century, claims that the philosophy of mathematics cannot concern itself with the making of mathematics, in particular discovery, but only with finished mathematics, namely mathematics presented in finished form. On this basis, mainstream philosophy of mathematics argues that mathematics is theorem proving by the axiomatic method. This, however, is untenable because it is incompatible with Gödel’s incompleteness theorems, and cannot account for many features of mathematics. (...) This book offers an alternative approach, heuristic philosophy of mathematics, according to which the philosophy of mathematics can concern itself with the making of mathematics, in particular discovery. On this basis, the book argues that mathematics is problem solving by the analytic method, and that this can account for all the main features of mathematics: mathematical method, objects, demonstrations, definitions, diagrams, notations, explanations, beauty, applicability, and knowledge. (shrink)

The debate between exceptionalists and anti-exceptionalists about logic is often framed as concerning whether the justification of logical theories is a priori or a posteriori (for short: whether logic is a priori or a posteriori). As we substantiate (S1), this framing more deeply encodes the usual anti-exceptionalist thesis that logical theories, like scientific theories, are abductively justified, coupled with the common supposition that abduction is an a posteriori mode of inference, in the sense that the epistemic value of abduction is (...) (and, indeed, must be) a posteriori. In past work, however, we have argued that this common supposition is incorrect: abduction is an a priori mode of inference, in the sense that the epistemic value of abduction is (and indeed, must be) a priori (Biggs and Wilson 2017a, 2017b, 2019). After sketching our two main argumentative strategies for this conclusion (S2), we go on (S3) to consider its import on the proper understanding of anti-exceptionalism about logic. (shrink)

Nominalists are confronted with a grave difficulty: if abstract objects do not exist, what explains the success of theories that invoke them? In this paper, I make headway on this problem. I develop a formal language in which certain platonistic claims about properties and certain nominalistic claims can be expressed, develop a formal language in which only certain nominalistic claims can be expressed, describe a function mapping sentences of the first language to sentences of the second language, and prove some (...) facts about that function and facts about some sound logics for those languages. In doing so, I prove that, given some plausible metaphysical assumptions, a large class of sentences about properties of concrete objects are “safe” on nominalistic grounds. Whenever some true sentences about concrete objects and some sentences belonging to this class that are true according to platonists collectively entail a conclusion about concrete objects, some nominalistically acceptable sentences are true and entail the same conclusion. Because the proof can itself be formulated without abstract objects, it provides a nominalistic explanation of the success of theories that invoke properties of concrete objects. (shrink)

In this article, some classical paradoxes of infinity such as Galileo’s paradox, Hilbert’s paradox of the Grand Hotel, Thomson’s lamp paradox, and the rectangle paradox of Torricelli are considered. In addition, three paradoxes regarding divergent series and a new paradox dealing with multiplication of elements of an infinite set are also described. It is shown that the surprising counting system of an Amazonian tribe, Pirah ̃a, working with only three numerals (one, two, many) can help us to change our perception (...) of these paradoxes. A recently introduced methodology allowing one to work with finite, infinite, and infinitesimal numbers in a unique computational framework not only theoretically but also numerically is briefly described. This methodology is actively used nowadays in numerous applications in pure and applied mathematics and computer science as well as in teaching. It is shown in the article that this methodology also allows one to consider the paradoxes listed above in a new constructive light. (shrink)

In the last couple of years, a few seemingly independent debates on scientific explanation have emerged, with several key questions that take different forms in different areas. For example, the questions what makes an explanation distinctly mathematical and are there any non-causal explanations in sciences (i.e., explanations that don’t cite causes in the explanans) sometimes take a form of the question of what makes mathematical models explanatory, especially whether highly idealized models in science can be explanatory and in virtue of (...) what they are explanatory. These questions raise further issues about counterfactuals, modality, and explanatory asymmetries: i.e., do mathematical and non-causal explanations support counterfactuals, and how ought we to understand explanatory asymmetries in non-causal explanations? Even though these are very common issues in the philosophy of physics and mathematics, they can be found in different guises in the philosophy of biology where there is the statistical interpretation of the Modern Synthesis theory of evolution, according to which the post-Darwinian theory of natural selection explains evolutionary change by citing statistical properties of populations and not the causes of changes. These questions also arise in philosophy of ecology or neuroscience in regard to the nature of topological explanations. The question here is can the mathematical (or more precisely topological) properties in network models in biology, ecology, neuroscience, and computer science be explanatory of physical phenomena, or are they just different ways to represent causal structures. The aim of this special issue is to unify all these debates around several overlapping questions. These questions are: are there genuinely or distinctively mathematical and non-causal explanations?; are all distinctively mathematical explanations also non-causal; in virtue of what they are explanatory; does the instantiation, implementation, or in general, applicability of mathematical structures to a variety of phenomena and systems play any explanatory role? This special issue provides a platform for unifying the debates around several key issues and thus opens up avenues for better understanding of mathematical and non-causal explanations in general, but also, it will enable even better understanding of key issues within each of the debates. (shrink)

The topology optimization of computer communication network is studied based on improved genetic algorithm, a network optimization design model based on the establishment of network reliability maximization under given cost constraints, and the corresponding improved GA is proposed. In this method, the corresponding computer communication network cost model and computer communication network reliability model are established through a specific project, and the genetic intelligence algorithm is used to solve the cost model and computer communication network reliability model, respectively. It has (...) been proved that GA can solve the complex problems of computer working environment better, which is 80% higher than the general algorithm, and can select the optimal scheme pertinently. (shrink)

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)

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)

Es conocido que el Teorema de Completitud de Gödel, el Teorema del Colapso Transitivo de Mostowski y el Principio de Reflexión son resultados muy útiles en las investigaciones de Lógica matemática y/o los Fundamentos de la matemática. El objetivo de este trabajo es presentar algunas demostraciones clásicas de tales resultados: Dos del Teorema de Completitud de Gödel, una del Teorema del Colapso Transitivo de Mostowski y una del Principio de Reflexión. Se aspira que estas notas sean de utilidad para estudiar (...) dichas pruebas. Vale la pena resaltar que entre los métodos matemáticos que se utilizan en tales demostraciones se encuentran: (1) La técnica de construcción de modelos a partir de constantes (o "método del conjunto maximal consistente con un conjunto de testigos" de Henkin) y (2) el Principio de inducción matemática en varias versiones [ (2.1) Inducción matemática sobre los números naturales y (2.2) Inducción transfinita ((2.2.1) Inducción transfinita sobre conjuntos bien ordenados cualesquiera, por ejemplo sobre un cardinal infinito Alef_alfa, (2.2.2) Inducción transfinita sobre una clase de conjuntos bien ordenada, por ejemplo sobre la "clase de todos los ordinales, finitos o infinitos", y (2.2.3) Inducción transfinita sobre relaciones bien fundamentadas, por ejemplo sobre la "relación de pertenencia" entre conjuntos)]. (shrink)

Es conocido que el método de forcing es una de las técnicas de construcción de modelos más importantes de la Teoría de conjuntos en la actualidad, siendo el mismo muy útil para investigar problemas de matemática y/o de fundamentos de la matemática. El destacado matemático Joan Bagaria afirma lo siguiente sobre el método de forcing en su artículo "Paul Cohen y la técnica del forcing" (Gaceta de la Real Sociedad Matemática Española, Vol. 2, Nº 3, 1999, págs 543-553) : "Aunque (...) Cohen recibió la medalla Fields por su demostración de la independencia de la hipótesis del continuo y del axioma de elección, su contribución va mucho más allá de estos problemas. Su nuevo método, el forcing, no sólo ha permitido resolver un sinfín de problemas importantes en prácticamente todas las áreas de las matemáticas, si no que ha cambiado para siempre nuestra concepción de la matemática como ciencia". El objetivo principal del siguiente trabajo es estudiar el método de forcing describiendo algunas de sus aplicaciones (forcing de Cohen, forcing aleatorio, forcing de Mathias, forcing de Sacks, forcing de Silver, etc.), y ofreciendo una aproximación a sus fundamentos metamatemáticos. Se aspira que estas notas sirvan de apoyo para aprender dicho método. (shrink)

El estudio de los "cardinales grandes" es uno de los principales temas de investigación de la teoría de conjuntos y de la teoría de modelos que ha contribuido con el desarrollo de dichas disciplinas. Existe una gran variedad de tales cardinales, por ejemplo cardinales inaccesibles, débilmente compactos, Ramsey, medibles, supercompactos, etc. Tres valiosos teoremas clásicos sobre cardinales medibles son los siguientes: (i) compacidad débil, (ii) Si κ es un cardinal medible, entonces κ es un cardinal inaccesible y existen κ cardinales (...) inaccesibles menores que κ , y (iii) Si existe un cardinal medible, entonces el axioma de constructibilidad (V=L) es falso. El objetivo de este artículo es presentar una demostración de cada uno de estos tres teoremas en el contexto de la teoría de modelos usando ideas del texto de Chang y Keisler (Model Theory). Tales demostraciones tienen en común el uso del método de construcción de modelos llamado ultraproductos, de lógicas infinitarias o fragmentos de la lógica de segundo orden, y del axioma de elección. Cardinales grandes y/o ultraproductos son importantes en teoría de conjuntos, teoría de modelos, análisis matemático, teoría de la medida, probabilidades, topología, análisis funcional, física, teoría de números, finanzas, etc. (shrink)

The objective of this document is to present three introductory notes on set theory: The first note presents an overview of this discipline from its origins to the present, in the second note some considerations are made about the evaluation of reasoning applying the first-order Logic and Löwenheim's theorems, Church Indecidibility, Completeness and Incompleteness of Gödel, it is known that the axiomatic theories of most commonly used sets are written in a specific first-order language, that is, they are developed within (...) the framework of first-order logic, so this note is relevant; and the third note refers to the presence of mathematical platonism in the axioms of ZFC and in the axioms of "complete ordered field", it is known that the last axioms mentioned characterize (except isomorphism) the real number system and are currently used to develop the real Analysis in the context of set theory. It is hoped that this article will be of pedagogical utility for students interested in set theory and in the philosophy of mathematics (that are beginning in the subject). (shrink)

El análisis de las propiedades geométricas de las configuraciones finitas ha sido uno de los objetivos fundamentales del estudio de las diversas geometrías discretas y de la geometría combinatoria. Este artículo propone plantear la posibilidad de una elucidación de lo matemático desde una perspectiva derivada de las ‘matemáticas en acción’ y no desde una concepción ‘analítico gramatical’ de sus fundamentos, y establecer, al menos, un mínimo umbral de validez, que articule una interpretación semiótica de los signos matemáticos, a través del (...) análisis de un par de ejemplos elementales de geometría configuracional, cuyas construcciones son propuestas por el autor. (shrink)

El presupuesto según el cual el contenido de una manifestación compleja está en función de los contenidos de sus partes componentes, expresa claramente una intuición que solemos tener sobre lo múltiple; implica una reflexión sobre la relación entre el todo y las partes que lo componen; involucra una teoría de las multiplicidades que entraña atributos de naturaleza matemática; presenta el problema de cómo los seres humanos nos relacionamos con los entornos del mundo para generar unidad de sentido. La significación es (...) un proceso de síntesis. Y desentrañar los mecanismos de funcionamiento de dicho proceso es un enigma de carácter eminentemente fenomenológico. La matemática misma, como acto de significación, como conjunto de actos de contenidos intencionales, comparte este carácter y es susceptible de tratamiento fenomenológico. Noesis y semiosis se conjugan para dotar al saber matemático de un contenido, de articulación compleja, que trasciende las perspectivas meramente logicistas, formalistas o intuicionistas. Una primera aproximación a esta problemática es el propósito del presente trabajo. (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)

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 (2013) al respecto. En esta breve nota se comenta sobre el tema de una manera divulgativa. (shrink)

En este trabajo matemático-filosófico se estudian cuatro tópicos de la Lógica matemática: El método de construcción de modelos llamado Ultraproductos, la Propiedad de Interpolación de Craig, las Álgebras booleanas y los Órdenes parciales separativos. El objetivo principal del mismo es analizar la importancia que tienen dichos tópicos para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático. Para cumplir con tal objetivo se trabajará en el ámbito de la Matemática, de la Metamatemática y (...) de la Filosofía de la matemática. El desarrollo de la investigación arrojó como resultado que tales tópicos son muy importantes para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático, y en el trabajo se explica detalladamente con abundantes ejemplos el porqué (al final de cada sección y al final del mismo). (shrink)

Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are a wide variety of classical theorems in various branches of mathematics where ultrafilters are applied in their proof, and other classical theorems that deal directly with ultrafilters. The objective of this article is to contribute (in a divulgative way) to ultrafilter research by describing the demonstrations of some such theorems related (uniquely or in combination) to topology, Measure Theory, algebra, combinatorial infinite, set theory and first-order logic, (...) also formulating some updated open problems of set theory that refer to non-principal ultrafilters on N, the Mathias’s model and the Solovay’s model. -/- Resumen: Los ultrafiltros son objetos matemáticos muy importantes en la investigación matemática [6, 22, 23]. Existen una gran variedad de teoremas clásicos en diversas ramas de la matemática donde se aplican ultrafiltros en su demostración, y otros teoremas clásicos que tratan directamente sobre ultrafiltros. El objetivo de este artículo es contribuir (de una manera divulgativa) con la investigación sobre ultrafiltros describiendo las demostraciones de algunos de tales teoremas relacionados (de manera única o combinada) con topología, teoría de la medida, álgebra, combinatoria infinita, teoría de conjuntos y lógica de primer orden, formulando además algunos problemas abiertos actuales de la teoría de conjuntos que se refieren a ultrafiltros no principales sobre N, al Modelo de Mathias y al Modelo de Solovay. (shrink)

The objective of this article is to present an original proof of the following theorem: Thereis a generic extension of the Solovay’s model L(R) where there is a linear order of P(N)/fin that extends to the partial order (P(N)/f in), ≤*). Linear orders of P(N)/fin are important because, among other reasons, they allow constructing non-measurable sets, moreover they are applied in Ramsey's Theory .

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.

El objetivo de este artículo es presentar dos tópicos de Lógica matemática y sus fundamentos: El primer tópico es una actualización de la demostración de Alonzo Church del Teorema de completitud de Gödel para la Lógica de primer orden, la cual aparece en su texto "Introduction to Mathematical Logic" (1956) y usa el procedimientos efectivos de Forma normal prenexa y Forma normal de Skolem; y el segundo tópico es una demostración de que la propiedad de partición (tipo Ramsey) del espacio (...) topológico de Baire llamada "Propiedad de partición polarizada" es falsa en el Modelo Básico de Cohen. (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.

Is consistency the sort of thing that could provide a guide to mathematical ontology? If so, which notion of consistency suits this purpose? Mark Balaguer holds such a view in the context of platonism, the view that mathematical objects are non-causal, non-spatiotemporal, and non-mental. For the purposes of this paper, we will examine several notions of consistency with respect to how they can provide a platon-ist epistemology of mathematics. Only a Gödelian notion, we suggest, can provide a satisfactory guide to (...) a platonist ontology. Is consistency the sort of thing that could provide a guide to mathematical ontology? If so, which notion of consistency suits this purpose? Mark Bala-guer holds such a view in the context of platonism, the view that mathematical objects are non-causal, non-spatiotemporal, and non-mental. Balaguer's version of Platonism, Full-Blooded Platonism (FBP), is the view that "there are as many abstract mathematical objects as there could be-i.e., there actually exist abstract mathematical objects of all possible kinds" (Balaguer, 2017, p. 381). He continues: Since FBP says that there are abstract mathematical objects of all possible kinds, it follows that if FBP is true, then every purely mathematical theory that could be true-i.e., that is internally consistent-accurately describes some collection of actually existing abstract objects. Thus it follows from FBP that in order to acquire knowledge of abstract objects, all we have to do is come up with an internally consistent purely mathematical theory (and know that it is internally consistent). (Balaguer, 2017, p. 381) * To be published in 43rd International Wittgenstein Symposium proceedings. (shrink)

This third edition of The Infinite includes a new part 'Infinity Superseded' which contains two new chapters refining Moore's ideas through a re-examination of the ideas of Spinoza, Hegel, and Nietzsche. Much of this is heavily influenced by the work of Deleuze. There is also a new technical appendix on still unresolved issues about different infinite sizes.

Whether the hands-on experience of creating inventions can promote Students’ interest in pursuing a science, technology, engineering, and mathematics (STEM) career has not been extensively studied. In a quantitative study, we drew on the attitude-behavior-outcome framework to explore the correlates between hands-on making attitude, epistemic curiosities, and career interest. This study targeted students who joined the selection competition for participating in the International Exhibition of Young Inventors (IEYI) in Taiwan. The objective of the invention exhibition is to encourage young students (...) to make innovative projects by applying STEM knowledge and collaborative design. We collected 220 valid data from participants in the 2021 Taiwan IEYI selection competition and conducted a confirmatory factor analysis and structural equation modeling to test the hypotheses. Results indicated that: (1) hands-on making attitude was positively related to two types of epistemic curiosity; (2) interest-type epistemic curiosity (IEC) and deprivation-type epistemic curiosity (DEC) were positively associated with STEM career interest; additionally, DEC had a higher coefficient on STEM career interest than IEC; (3) both types of EC had a mediating role between hands-on making attitude and STEM career interest. It is expected that encouraging students to participate in invention exhibition competitions can raise both types of EC and increase their interest in pursuing STEM careers. (shrink)

. In our research about Fuzzy Time and modeling time, "Unexpected Hanging Paradox" plays a major role. Here, we compare this paradox to the Zeno Paradox and the relations of them with our standard models of continuum and Fuzzy numbers. To do this, we review the project "Fuzzy Time and Possible Impacts of It on Science" and introduce a new way in order to approach the solutions for these paradoxes. Additionally, we have a more general discussion about paradoxes, as Philosophical (...) back ground of the subject and in this way, we introduce the concepts of General View, the first picture, BBF-General View. -/- . (shrink)

This article develops a criticism of Alain Badiou’s assertion that “mathematics is ontology.” I argue that despite appearances to the contrary, Badiou’s case for bringing set theory and ontology together is problematic. To arrive at this judgment, I explore how a case for the identification of mathematics and ontology could work. In short, ontology would have to be characterised to make it evident that set theory can contribute to it fundamentally. This is indeed how Badiou proceeds in Being and Event. (...) I review his descriptions of the ontological problematic at some length here, only to argue that set theory is a poor fit. Although philosophers working on questions of being were certainly occupied with matters of oneness and the part-whole relationship, I argue that Badiou’s discussion of philosophical sources points towards a mereological treatment, not a set-theoretic one. Finally, I suggest that Badiou’s philosophical interpretations of key set-theoretic results are better understood as some sort of analogising between mathematics, ontology, and philosophical anthropology. (shrink)

The latest draft (posted 05/14/22) of this short, concise work of proof, theory, and metatheory provides summary meta-proofs and verification of the work and results presented in the Theory and Metatheory of Atemporal Primacy and Riemann, Metatheory, and Proof. In this version, several new and revised definitions of terms were added to subsection SS.1; and many corrected equations, theorems, metatheorems, proofs, and explanations are included in the main text. The body of the text is approximately 18 pages, with 3 sections; (...) 1, an Introduction (with a 108 page listing of key terms & definitions), sect. 2, the Results, sect. 3, Discussion (commentary & predictions), and sect. 4, Works Cited. As much as possible, the style is intended for readability and understanding by very bright children (with some interest & knowledge of maths, etc.) and very interested nonprofessionals. The results of this project also enable upgrades of number theory, set theory, proof theory, metamathematics, the foundations of science, and quantum mechanics theory (etc.). (shrink)