If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.

Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.

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 essay aims to redress the contention that epistemic possibility cannot be a guide to the principles of modal metaphysics. I introduce a novel epistemic two-dimensional truthmaker semantics. I argue that the interaction between the two-dimensional framework and the mereological parthood relation, which is super-rigid, enables epistemic possibilities and truthmakers with regard to parthood to be a guide to its metaphysical profile. I specify, further, a two-dimensional formula encoding the relation between the epistemic possibility and verification of essential properties obtaining (...) and their metaphysical possibility or verification. I then generalize the approach to haecceitistic properties, and examine the Julius Caesar problem as a test case. (shrink)

This work deals with problems involving infinities and infinitesimals. It explores the ideas behind zero, its relationship to ontological nothingness, finititude (such as finite numbers and quantities), and the infinite. The idea of infinity and zero are closely related, despite what many perceive as an intuitive inverse relationship. The symbol 0 generally refers to nothingness, whereas the symbol infinity refers to ``so much'' that it cannot be quantified or captured. The notion of finititude rests somewhere between complete nothingness and something (...) having no end. -/- My concern is that many of the philosophers arguing for or against the ontology (or possibility) of an actual infinite set are unaware or unfamiliar with the mathematical literature attempting to clearly and rigorously define these terms. I believe it is a mistake to leave mathematicians out of this conversation, as analysts in particular have defined (and used) infinity in a way that is relevant to the ongoing debate between philosophers. -/- For this paper, I have selected examples from Principles of Analysis by Walter Rudin, which has become a standard text for Real Analysis classes taken by pure mathematicians and engineers. I will also restrict the scope of examples to Euclidean spaces for simplicity. Finally, I will be using addition, + and multiplication * in their usual way. (shrink)

This paper addresses the question: given some theory T that we accept, is there some natural, generally applicable way of extending T to a theory S that can prove a range of things about what it itself (i.e. S) can prove, including a range of things about what it cannot prove, such as claims to the effect that it cannot prove certain particular sentences (e.g. 0 = 1), or the claim that it is consistent? Typical characterizations of Gödel’s second incompleteness (...) theorem, and its significance, would lead us to believe that the answer is ‘no’. But the present paper explores a positive answer. The general approach is to follow the lead of recent (and not so recent) approaches to truth and the Liar paradox. (shrink)

The notion of a proposition is central to philosophy. But it is subject to paradoxes. A natural response is a hierarchical account and, ever since Russell proposed his theory of types in 1908, this has been the strategy of choice. But in this paper I raise a problem for such accounts. While this does not seem to have been recognized before, it would seem to render existing such accounts inadequate. The main purpose of the paper, however, is to provide a (...) new hierarchical account that solves the problem. (shrink)

Computer simulation and thought experiments seem to produce knowledge about the world without intervening in the world. This has called for a comparison between the two methods. However, Chandrasekharan et al. argue that the nature of contemporary science is too complex for using TEs. They suggest CS as the tool for contemporary sciences and conclude that it will replace TEs. In this paper, by discussing a few TEs from the history of science, I show that the replacement thesis about TE (...) is a failure. The paper is divided into three sections. The first section discusses the arguments of Chandrasekharan et al. and demonstrates the three distinct aspects of the replacement thesis. The second section examines the argument against TE and shows that they are inadequate to prove the withering of TE from science. The third section discusses Albert Einstein’s Magnet and Conductor TE and demonstrates that replacing such TE with CS yield no advantage. (shrink)

Certain selected issues around the Gödelian anti-mechanist arguments which have received less attention are discussed.

This paper provides a philosophical analysis of the Price equation and its role in evolutionary theory. Traditional models in population genetics postulate simplifying assumptions in order to make the models mathematically tractable. On the contrary, the Price equation implies a very specific way of theorizing, starting with assumptions that we think are true and then deriving from them the mathematical rules of the system. I argue that the Price equation is a generalization-sketch, whose main purpose is to provide a unifying (...) framework for researchers, helping them to develop specific models. The Price equation plays this role because, like other scientific principles, shows features as abstractness, unification and invariance. By underwriting this special role for the Price equation some recent disputes about it could be diverted. (shrink)

The knower paradox states that the statement ‘We know that this statement is false’ leads to inconsistency. This article presents a fresh look at this paradox and some well-known solutions from the literature. Paul Égré discusses three possible solutions that modal provability logic provides for the paradox by surveying and comparing three different provability interpretations of modality, originally described by Skyrms, Anderson, and Solovay. In this article, some background is explained to clarify Égré’s solutions, all three of which hinge on (...) intricacies of provability logic and its arithmetical interpretations. To check whether Égré’s solutions are satisfactory, we use the criteria for solutions to paradoxes defined by Susan Haack and we propose some refinements of them. This article aims to describe to what extent the knower paradox can be solved using provability logic and to what extent the solutions proposed in the literature satisfy Haack’s criteria. Finally, the article offers some reflections on the relation between knowledge, proof, and provability, as inspired by the knower paradox and its solutions. (shrink)

The Turing Machine presents itself as the very landmark and initial design of digital automata present in all modern general-purpose digital computers and whose design on computable numbers implies deeply ontological as well as epistemological foundations for today’s computers. These lines of work attempt to briefly analyze the fundamental epistemological problem that rose in the late 19th and early 20th century whereby “machine cognition” emerges. The epistemological roots addressed in the TM and notably in its “Halting Problem” uncovers the tension (...) between determinism and uncertainty, regarded here as the primal and inherent features of machine cognition. Resumen La Máquina de Turing se presenta como el hito y el diseño inicial de un autómata digital presente en todas las computadoras digitales modernas de propósito general y cuyo diseño en números computables establece bases profundamente ontológicas y epistemológicas para las computadoras de hoy. Estas líneas de trabajo intentan analizar brevemente el problema epistemológico fundamental que surgió a finales del siglo XIX y principios del XX mediante el cual emerge la “cognición de la máquina”. Las raíces epistemológicas que se abordan en la TM y, en particular, en su “Problema de detención” ponen al descubierto la tensión entre el determinismo y la incertidumbre, consideradas aquí, como las características primordiales e inherentes de la cognición de la máquina. (shrink)