Axiomatic Truth

Deductionism assimilates nature to conceptual artifacts (models, equations), and tacitly holds that real physical systems are such artifacts. Some physical concepts represent properties of deductive systems rather than of nature. Properties of mathematical or deductive systems can thereby sometimes falsely be ascribed to natural systems.

Both Tarski and Gödel “prove” that provability can diverge from Truth. When we boil their claim down to its simplest possible essence it is really claiming that valid inference from true premises might not always derive a true consequence. This is obviously impossible.

We can simply define Gödel 1931 Incompleteness away by redefining the meaning of the standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). This definition construes the existence of self-contradictory expressions in a formal system as proof that this formal system is incomplete because self-contradictory expressions are neither provable nor disprovable in this formal system. Since self-contradictory expressions are neither provable nor disprovable (...) only because they are self-contradictory we could define them as unsound instead of defining the formal system as incomplete. (shrink)

Could the intersection of [formal proofs of mathematical logic] and [sound deductive inference] specify formal systems having [deductively sound formal proofs of mathematical logic]? All that we have to do to provide [deductively sound formal proofs of mathematical logic] is select the subset of conventional [formal proofs of mathematical logic] having true premises and now we have [deductively sound formal proofs of mathematical logic].

Minimal Type Theory (MTT) is based on type theory in that it is agnostic about Predicate Logic level and expressly disallows the evaluation of incompatible types. It is called Minimal because it has the fewest possible number of fundamental types, and has all of its syntax expressed entirely as the connections in a directed acyclic graph.

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic property of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide valid the deductive inference. Conclusions of sound arguments are derived from truth preserving finite string transformations applied to true premises.

The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. The pathological self-reference of the conventional halting problem proof counter-examples is overcome. The halt status of these examples is correctly determined. A simulating halt decider remains in pure simulation mode until after it determines that its input will never reach its final state. This eliminates the conventional feedback loop where the behavior of the halt decider effects the behavior of its input.

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

The notion of implicit commitment has played a prominent role in recent works in logic and philosophy of mathematics. Although implicit commitment is often associated with highly technical studies, it remains so far an elusive notion. In particular, it is often claimed that the acceptance of a mathematical theory implicitly commits one to the acceptance of a Uniform Reflection Principle for it. However, philosophers agree that a satisfactory analysis of the transition from a theory to its reflection principle is still (...) lacking. We provide an axiomatization of the minimal commitments implicit in the acceptance of a mathematical theory. The theory entails that the Uniform Reflection Principle is part of one's implicit commitments, and sheds light on the reason why this is so. We argue that the theory has interesting epistemological consequences in that it explains how justified belief in the axioms of a theory can be preserved to the corresponding reflection principle. The theory also improves on recent proposals for the analysis of implicit commitment based on truth or epistemic notions. (shrink)

In the substitutional framework, validity is truth under all substitutions of the nonlogical vocabulary. I develop a theory where □ is interpreted as substitutional validity. I show how to prove soundness and completeness for common modal calculi using this definition.

The infinitary function of the truth predicate consists in its ability to express infinite conjunctions and disjunctions. A transparency principle for truth states the equivalence between a sentence and its truth predication; it requires an introduction principle—which allows the inference from “snow is white” to “the sentence ‘snow is white’ is true”—and an elimination principle—which allows the inference from “the sentence ‘snow is white’ is true” to “snow is white”. It is commonly assumed that a theory of truth needs to (...) satisfy a transparency principle to fulfil the infinitary function. Picollo and Schindler (Erkenntnis 83:899–928, 2017) argue against this idea. They prove that, given certain assumptions, an elimination principle is sufficient for the purpose. Then, they pose a challenge: to show why we should incorporate introduction principles to our theory of truth. In this essay I take on the challenge. I show that, given the authors’ assumptions, an introduction principle is also sufficient to perform the infinitary function. (shrink)

An excerpt of "The SignalGlyph Project and Prime Numbers" (a chapter of the book THE IMAGE OF LANGUAGE) that attempts to illustrate how dimensional limitations of mathematical language have obscured recognition of the system of patterning in the distribution of prime numbers.

En ' Godel’s Way ', tres eminentes científicos discuten temas como la indecisión, la incompleta, la aleatoriedad, la computabilidad y la paraconsistencia. Me acerco a estas cuestiones desde el punto de vista de Wittgensteinian de que hay dos cuestiones básicas que tienen soluciones completamente diferentes. Existen las cuestiones científicas o empíricas, que son hechos sobre el mundo que necesitan ser investigados observacionalmente y cuestiones filosóficas en cuanto a cómo el lenguaje se puede utilizar inteligiblemente (que incluyen ciertas preguntas en matemáticas (...) y lógica), que necesitan decidirse por unt cómo realmente usar palabras en contextos concretos. Cuando tenemos claro sobre qué juego de idiomas estamos jugando, estos temas son vistos como preguntas científicas y matemáticas ordinarias como cualquier otra. Las percepciones de Wittgenstein rara vez se han igualado y nunca superado y son tan pertinentes hoy como lo fueron hace 80 años cuando dictó los libros azul y marrón. A pesar de sus fallas — realmente una serie de notas en lugar de un libro terminado —, esta es una fuente única de la obra de estos tres eruditos famosos que han estado trabajando en los bordes sangrantes de la física, las matemáticas y la filosofía durante más de medio siglo. Da Costa y Doria son citados por Wolpert (ver abajo o mis artículos sobre Wolpert y mi reseña de ' los límites de la razón ' de Yanofsky) desde que escribieron en el cómputo universal, y entre sus muchos logros, da Costa es pionera en paraconsistencia. Aquellos que deseen un marco completo hasta la fecha para el comportamiento humano de la moderna dos sistemas punto de vista puede consultar mi libros Talking Monkeys 3ª ed (2019), Estructura Logica de Filosofia, Psicología, Mente y Lenguaje en Ludwig Wittgenstein y John Searle 2a ed (2019), Suicidio pela Democracia 4ª ed (2019), La Estructura Logica del Comportamiento Humano (2019), The Logical Structure de la Conciencia (2019, Entender las Conexiones entre Ciencia, Filosofía, Psicología, Religión, Política y Economía y Delirios Utópicos Suicidas en el siglo 21 5ª ed (2019), Observaciones sobre Imposibilidad, Incompletitud, Paraconsistencia, Indecidibilidad, Aleatoriedad, Computabilidad, Paradoja e Incertidumbre en Chaitin, Wittgenstein,. (shrink)

This paper investigates a set of issues connected with the so-called conservativeness argument against deflationism. Although I do not defend that argument, I think the discussion of it has raised some interesting questions about whether what I call “compositional principles,” such as “a conjunction is true iff its conjuncts are true,” have substantial content or are in some sense logically trivial. The paper presents a series of results that purport to show that the compositional principles for a first-order language, taken (...) together, have substantial logical strength, amounting to a kind of abstract consistency statement. (shrink)

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (2005), and the dependence digraph by Beringer & Schindler (2015). Unlike the usual discussion about self-reference of paradoxes centering around Yablo's paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb's dependence relation. They are called 'locally finite paradoxes', satisfying that any sentence in these paradoxes can depend on finitely many sentences. I prove (...) that all locally finite paradoxes are self-referential in the sense that there is a directed cycle in their dependence digraphs. This paper also studies the 'circularity dependence' of paradoxes, which was introduced by Hsiung (2014). I prove that the locally finite paradoxes have circularity dependence in the sense that they are paradoxical only in the digraph containing a proper cycle. The proofs of the two results are based directly on König's infinity lemma. In contrast, this paper also shows that Yablo's paradox and its nested variant are non-self-referential, and neither McGee's paradox nor the omega-cycle liar paradox has circularity dependence. (shrink)

This paper makes two claims. Firstly, it shows that thinking the truth of any particular concept (such as politics) is founded upon an instrumental logic that betrays the truth of a situation. Truth cannot be thought ‘of something’, for this would fall back into a theory of correspondence. Instead, truth is a function of thought. In order to make this move to a functional concept of truth, I outline Dewey’s criticism, and two important repercussions, of dogmatically instrumental philosophy. I then (...) show how Badiou’s philosophy is indeed guilty of instrumentalisation, but emphasise that his prioritisation of truth is nevertheless important to maintain. The second claim this paper makes is that the criticism of Deleuze’s conception of truth as circular is misplaced, as it is founded on the assumption that Deleuze conceptualises the truth of objects. Instead, I show that, for Deleuze, truth is not a property of an object but of its production. To reach this conclusion, I develop what I call Dewey’s account of pragmatic instrumentalisation (as opposed to the dogmatic instrumentalisation he criticises) into Deleuze’s conceptualisation of truth as the process of making sense of our precarious world. I conclude by making some provisional remarks that Deleuze’s pragmatic account of truth paves the way for an ethics that is not founded on truths it cannot explain (i.e. God or mathematics), but as an ongoing, subversive practice. (shrink)

We present an overview of typed and untyped disquotational truth theories with the emphasis on their (non)conservativity over the base theory of syntax. Two types of conservativity are discussed: syntactic and semantic. We observe in particular that TB—one of the most basic disquotational theories—is not semantically conservative over its base; we show also that an untyped disquotational theory PTB is a syntactically conservative extension of Peano Arithmetic.

One of the popular explications of the deflationary tenet of ‘thinness’ of truth is the conservativeness demand: the declaration that a deflationary truth theory should be conservative over its base. This paper contains a critical discussion and assessment of this demand. We ask and answer the question of whether conservativity forms a part of deflationary doctrines.

Detlefsen (1986) reads Hilbert's program as a sophisticated defense of instrumentalism, but Feferman (1998) has it that Hilbert's program leaves significant ontological questions unanswered. One such question is of the reference of individual number terms. Hilbert's use of admittedly "meaningless" signs for numbers and formulae appears to impair his ability to establish the reference of mathematical terms and the content of mathematical propositions (Weyl (1949); Kitcher (1976)). The paper traces the history and context of Hilbert's reasoning about signs, which illuminates (...) Hilbert's account of mathematical objectivity, axiomatics, idealization, and consistency. (shrink)

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base.

An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...) with some intuitions underlying Wittgenstein’s philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any mathematical question. (shrink)

The criticism of Hilbert's axiomatic system of geometry by Mate Meršić (Merchich, 1850-1928), presented in his work "Organistik der Geometrie" (1914, also in "Modernes und Modriges", 1914), is analyzed and discussed. According to Meršić, geometry cannot be based on its own axioms, as a logical analysis of spatial intuition, but must be derived as a "spatial concretion" using "higher" axioms of arithmetic, logic, and "rational algorithmics." Geometry can only be one, because space is also only one. It cannot be reduced (...) to manipulation with symbols but has to deal with concepts and provide real knowledge. According to Meršić, aiming at some particular proof of the consistency of the whole axiomatic system is meaningless because the consistency follows from the truth of individual axioms based on spatial intuition. It is impossible, according to Meršić, for the geometric axioms to be mutually independent because they must be interconnected as essential parts of a whole. Although Meršić did not recognize all the advantages of Hilbert's formalization of geometry, he clearly pointed out some crucial limitations of the axiomatic method. (shrink)

Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...) successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

Internal Logic brings together several threads of Yvon Gauthier's work on the foundations of mathematics and revisits his attempt to, as he puts it, radicalize Hilbert's Program. A radicalization of Hilbert's Program, I take it, is supposed to take Hilberts' finitary viewpoint more seriously than other attempts to salvage Hilbert's Program have. Such a return to the "roots of Hilbert's metamathematical idea" will, so claims Gauthier, enable him to save Hilbert's Program.

This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that are (...) neither provable nor refutable. The first theorem is general in the sense that it applies to any axiomatic theory, which is ω-consistent, has an effective proof procedure, and is strong enough to represent basic arithmetic. Their importance lies in their generality: although proved specifically for extensions of system, the method Gödel used is applicable in a wide variety of circumstances. Gödel's results had a profound influence on the further development of the foundations of mathematics. It pointed the way to a reconceptualization of the view of axiomatic foundations. (shrink)

Proof by refutation of a geometry theorem that is not universally true produces a Gröbner basis whose elements, called side polynomials, may be used to give inequations that can be added to the hypotheses to give a valid theorem. We show that (in a certain sense) all possible subsidiary conditions are implied by those obtained from the basis; that what we call the kind of truth of the theorem may be derived from the basis; and that the side polynomials may (...) be classified in a useful way. We analyse the relationship between side polynomials and kinds of truth, and we give a unified algorithmic treatment of side polynomials, with examples generated by an implementation. (shrink)

David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...) little attention, and on a number of philosophical reconstructions of the viewpoint (in particular, by Hand, Kitcher, and Tait). (shrink)

Suppose one has a system, the infinite set of positive integers, P, and one wants to study the characteristics of a subset (or subsystem) of that system, the infinite subset of odd positives, O, relative to the overall system. In mathematics, this is done by pairing off each odd with a positive, using a function such as O=2P+1. This puts the odds in a one-to-one correspondence with the positives, thereby, showing that the subset of odds and the original set of (...) positives are the same size, or have the same cardinality. This counter-intuitive result ignores the “natural” relationship of one odd for every two positives in the sequence of positive integers, which would suggest that O is one-half the size of P. However, in the set of axioms that constitute mathematics, it is considered valid. Fair enough. In the physical universe (i.e., the starting system), though, relationships between entities matter. In biochemistry, if you start with an organism, say a rat, and you want to study its heart, you can do this by removing some heart cells and studying them in isolation in a cell culture system. But, the results often differ compared to what occurs in the intact animal because studying the isolated cultured cells ignores the relationships in the intact body between the cells, the rest of the heart tissue and the rest of the rat. In chemistry, if a copper atom were studied in isolation, it would never be known that copper atoms in bulk can conduct electricity because the atoms share their electrons. In physics, the relationships between inertial reference frames in relativity, and observer and observed in quantum physics can't be ignored. Relationships matter in the physical world, but the mathematics of infinite sets is still used to describe it. Does this matter? It seems to, at least in physics. Infinities cause numerous problems in theoretical physics such as non-renormalizability and problems in unifying quantum mehanics and general relativity . This suggests that the pairing off method and the mathematics of infinite sets based on it are analogous to a cell culture system or studying a copper atom in isolation if they are used in studying the physical universe because they ignore the inherent relationships between entities. In the real, physical world, the natural, inherent, relationships between entities can't be ignored. Said another way, the set of axioms that constitute abstract mathematics may be similar but not identical to the set of physical axioms by which the real, physical universe runs. This suggests that the results from abstract mathematics about infinities may not apply to or should be modified for use in physics. (shrink)

To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.

Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.