Fundamental properties of N-valued logics are compared and eleven theorems are presented for their Logic Algebras, including Łukasiewicz–Moisil Logic Algebras represented in terms of categories and functors. For example, the Fundamental Logic Adjunction Theorem allows one to transfer certain universal, or global, properties of the Category of Boolean Algebras,, (which are well-understood) to the more general category \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal L}$$\end{document}Mn of Łukasiewicz–Moisil Algebras. Furthermore, the relationships (...) of LMn-algebras to other many-valued logical structures, such as the n-valued Post, MV and Heyting logic algebras, are investigated and several pertinent theorems are derived. Applications of Łukasiewicz–Moisil Algebras to biological problems, such as nonlinear dynamics of genetic networks – that were previously reported – are also briefly noted here, and finally, probabilities are precisely defined over LMn-algebras with an eye to immediate, possible applications in biostatistics. (shrink)

Our aim is to illuminate the interconnected notions of meaning and truth. For this purpose, we investigate the relationship between meaning theories based on commonsensical ‘means that’ and interpretive truth theories. The latter are Tarski–Davidson-style truth theories serving as meaning theories. We consider analytically true semantic principles containing ‘means’ and ‘means that’ side to side with ‘denotes’, ‘satisfies’, and ‘true’, which constitute the extensional semantic constants of interpretive truth theories. We show that these semantic constants are definable in terms of (...) ‘means’ and ‘means that’ operators. The definitions themselves are semantic principles in the role of meaning postulates. We extend a meaning theory based on ‘means that’ by adjoining semantic principles to the axioms of the theory. Then, all axioms, hence all theorems, of a corresponding interpretive truth theory are provable in the extension of the meaning theory. Furthermore, every interpretive truth theory can be included in the extension of a corresponding meaning theory. Therefore, the extension of a meaning theory resulting from the adjunction of semantic principles constitutes a unified meaning-and-truth theory since it includes both a meaning theory and an interpretive truth theory. (shrink)

In [This Zeitschrift 25 , 45-52, 119-134, 447-464], Pavelka systematically discussed propositional calculi with values in enriched residuated lattices and developed a general framework for approximate reasoning. In the first part of this paper we introduce the concept of generalized quantifiers into Pavelka's logic and establish the fundamental theorem of ultraproduct in first order Pavelka's logic with generalized quantifiers. In the second part of this paper we show that the fundamental theorem of ultraproduct in (...) first order Pavelka's logic is preserved under some direct product of lattices of truth values. (shrink)

We offer a proof of the duality theorem for finitely presented MV-algebras and rational polyhedra, a folklore and yet fundamental result. Our approach develops first a general dual adjunction between MV-algebras and subspaces of Tychonoff cubes, endowed with the transformations that are definable in the language of MV-algebras. We then show that this dual adjunction restricts to a duality between semisimple MV-algebras and closed subspaces of Tychonoff cubes. The duality theorem for finitely presented objects is (...) obtained by a further specialisation. Our treatment is aimed at showing exactly which parts of the basic theory of MV-algebras are needed in order to establish these results, with an eye towards future generalisations. (shrink)

We give a short proof of the fundamental theorem of central element theory. The original proof is constructive and very involved and relies strongly on the fact that the class be a variety. Here we give a more direct nonconstructive proof which applies for the more general case of a first-order class which is both closed under the formation of direct products and direct factors.

The fundamental principle of the theory of possible worlds is that a proposition p is possible if and only if there is a possible world at which p is true. In this paper we present a valid derivation of this principle from a more general theory in which possible worlds are defined rather than taken as primitive. The general theory uses a primitive modality and axiomatizes abstract objects, properties, and propositions. We then show that this general theory has very (...) small models and hence that its ontological commitments—and, therefore, those of the fundamental principle of world theory—are minimal. (shrink)

Fundamental properties of N-valued logics are compared and eleven theorems are presented for their Logic Algebras, including Łukasiewicz–Moisil Logic Algebras represented in terms of categories and functors. For example, the Fundamental Logic Adjunction Theorem allows one to transfer certain universal, or global, properties of the Category of Boolean Algebras,, (which are well-understood) to the more general category \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal L}$$\end{document}Mn of Łukasiewicz–Moisil Algebras. Furthermore, the relationships (...) of LMn-algebras to other many-valued logical structures, such as the n-valued Post, MV and Heyting logic algebras, are investigated and several pertinent theorems are derived. Applications of Łukasiewicz–Moisil Algebras to biological problems, such as nonlinear dynamics of genetic networks – that were previously reported – are also briefly noted here, and finally, probabilities are precisely defined over LMn-algebras with an eye to immediate, possible applications in biostatistics. (shrink)

This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer’s principle in physics. The multiple-computations theorem implies that certain physical systems implement simultaneously more than one computation. Landauer’s principle implies that the physical implementation of “logically irreversible” functions is accompanied by minimal entropy increase. We show that the multiple-computations theorem is incompatible with, or at least challenges, the universal validity of Landauer’s principle. To this end we provide accounts of both ideas (...) in terms of low-level fundamental concepts in statistical mechanics, thus providing a deeper understanding of these ideas than their standard formulations given in the high-level terms of thermodynamics and cognitive science. Since Landauer’s principle is pivotal in the attempts to derive the universal validity of the second law of thermodynamics in statistical mechanics, our result entails that the multiple-computations theorem has crucial implications with respect to the second law. Finally, our analysis contributes to the understanding of notions, such as “logical irreversibility,” “entropy increase,” “implementing a computation,” in terms of fundamental physics, and to resolving open questions in the literature of both fields, such as: what could it possibly mean that a certain physical process implements a certain computation. (shrink)

After a brief and informal explanation of the Gödel’s theorem as a version of the Epimenides’ paradox applied to Elementary Number Theory formulated in first-order logic, Lucas shows some of the most relevant consequences of this theorem, such as the impossibility to define truth in terms of provability and so the failure of Verificationist and Intuitionist arguments. He shows moreover how Gödel’s theorem proves that first-order arithmetic admits non-standard models, that Hilbert’s programme is untenable and that (...) second-order logic is not mechanical. There are furthermore some more general consequences: the difference between being reasonable and following a rule and the possibility that one man’s insight differs from another’s without being wrong. Finally some consequences concerning moral and political philosophy can arise from Gödel’s theorem, because it suggests that – instead of some fundamental principle from which all else follows deductively – we can seek for different arguments in different situations. (shrink)

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valua- tion in quantum mechanics as exemplified, in particular, by Kochen-Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event al- gebras. We show explicitly that the latter category is equipped with (...) an object of truth values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is in- herent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical im- plications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. In this light, the transcendence condition of the usual concep- tion of correspondence truth is superseded by a reflective-like transcendental reasoning of the proposed account of truth that is suitable to the quantum domain of discourse. (shrink)

Suppose T is superstable. Let ≤ denote the fundamental order on complete types, [ p] the class of the bound of p, and U(--) Lascar's foundation rank (see [LP]). We prove THEOREM 1. If $q and there is no r such that $q , then U(q) + 1 = U(p). THEOREM 2. Suppose $U(p) and $\xi_1 is a maximal descending chain in the fundamental order with ξ κ = [ p]. Then k = U(p). That the (...) finiteness of U(p) in Theorem 2 is necessary follows from THEOREM 3. There is an ω-stable theory with a type p ∈ S 1 (φ) such that (1) U(p) = ω + 1, and (2) there is a maximal descending chain of proper extensions of [ p] which has order type ω. (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and (...) commonsense reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

Using Heijenoort’s unpublished generalized rules of quantification, we discuss the proof of Herbrand’s Fundamental Theorem in the form of Heijenoort’s correction of Herbrand’s “False Lemma” and present a didactic example. Although we are mainly concerned with the inner structure of Herbrand’s Fundamental Theorem and the questions of its quality and its depth, we also discuss the outer questions of its historical context and why Bernays called it “the central theorem of predicate logic” and considered (...) the form of its expression to be “concise and felicitous”. (shrink)

A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of each model or hypothesis. Thomas Bayes’ Theorem relates the data and prior information to posterior probabilities associated with differing models or hypotheses and thus is useful in identifying the roles played by the known data and the assumed prior information when (...) making inferences. Scientists, philosophers, and theologians accumulate knowledge when analyzing different aspects of reality and search for particular hypotheses or models to fit their respective subject matters. Of course, a main goal is then to integrate all kinds of knowledge into an all-encompassing worldview that would describe the whole of reality. A generous description of the whole of reality would span, in the order of complexity, from the purely physical to the supernatural. These two extreme aspects of reality are bridged by a nonphysical realm, which would include elements of life, man, consciousness, rationality, mental and mathematical abstractions, etc. An urgent problem in the theory of knowledge is what science is and what it is not. Albert Einstein’s notion of science in terms of sense perception is refined by defining operationally the data that makes up the subject matter of science. It is shown, for instance, that theological considerations included in the prior information assumed by Isaac Newton is irrelevant in relating the data logically to the model or hypothesis. In addition, the concepts of naturalism, intelligent design, and evolutionary theory are critically analyzed. Finally, Eugene P. Wigner’s suggestions concerning the nature of human consciousness, life, and the success of mathematics in the natural sciences is considered in the context of the creative power endowed in humans by God. (shrink)

The recursion theorem in abstract partially ordered algebras, such as operative spaces and others, is the most fundamental result of algebraic recursion theory. The primary aim of the present paper is to prove this theorem for iterative operative spaces in full generality. As an intermediate result, a new and rather large class of models of the combinatory logic is obtained.

This paper is an investigation in the use of truthmaker theory for exploring the relation of logic to world, and as a tool for metaphysics. A variant of truthmaker theory, which we call the simple theory, is defined and defended against objections. It is characterized formally, and its central features are derived. As part of this project, we give a formal metaphysics based on nondeterministic necessitation relations among possible entities. In what is called the fundamental theorem of (...) truthmaking, it is shown that, as long as a logic is sound and complete, its inferential structure will be isomorphic to the necessitation structure of our metaphysics. We thus arrive at a purely structural logic–world relationship which can be used for metaphysical investigations. Other products of our investigation are a sound and complete semantics for first-order logic with identity and a solution to a result of Restall which has threatened to make truthmaker theory trivial. (shrink)

The article focuses on representing different forms of non-adjunctive inference as sub-Kripkean systems of classical modal logic, where the inference from □A and □B to □A ∧ B fails. In particular we prove a completeness result showing that the modal system that Schotch and Jennings derive from a form of non-adjunctive inference in (Schotch and Jennings, 1980) is a classical system strictly stronger than EMN and weaker than K (following the notation for classical modalities presented in Chellas, 1980). The (...) unified semantical characterization in terms of neighborhoods permits comparisons between different forms of non-adjunctive inference. For example, we show that the non-adjunctive logic proposed in (Schotch and Jennings, 1980) is not adequate in general for representing the logic of high probability operators. An alternative interpretation of the forcing relation of Schotch and Jennings is derived from the proposed unified semantics and utilized in order to propose a more fine-grained measure of epistemic coherence than the one presented in (Schotch and Jennings, 1980). Finally we propose a syntactic translation of the purely implicative part of Jaśkowski's system D₂ into a classical system preserving all the theorems (and non-theorems) explicilty mentioned in (Jaśkowski, 1969). The translation method can be used in order to develop epistemic semantics for a larger class of non-adjunctive (discursive) logics than the ones historically investigated by Jaśkowski. (shrink)

The Schur-Zassenhaus Theorem is one of the fundamental theorems of finite group theory. Here is its statement:Fact1.1 (Schur-Zassenhaus Theorem). Let G be a finite group and let N be a normal subgroup of G. Assume that the order ∣N∣ is relatively prime to the index [G:N]. Then N has a complement in G and any two complements of N are conjugate in G.The proof can be found in most standard books in group theory, e.g., in [S, Chapter (...) 2, Theorem 8.10]. The original statement stipulated one ofNorG/Nto be solvable. Since then, the Feit-Thompson theorem [FT] has been proved and it forces eitherNorG/Nto be solvable. (The analogous Feit-Thompson theorem for groups of finite Morley rank is a long standing open problem).The literal translation of the Schur-Zassenhaus theorem to the finite Morley rank context would state that in a groupGof finite Morley rank a normal π-Hall subgroup (if it exists at all) has a complement and all the complements are conjugate to each other. (Recall that a groupHis called aπ-group, where π is a set of prime numbers, if elements ofHhave finite orders whose prime divisors are from π. Maximal π-subgroups of a groupGare called π-Hall subgroups. They exist by Zorn's lemma. Since a normal π-subgroup ofGis in all the π-Hall subgroups, if a group has a normal π-Hall subgroup then this subgroup is unique.)The second assertion of the Schur-Zassenhaus theorem about the conjugacy of complements is false in general. As a counterexample, consider the multiplicative group ℂ* of the complex number field ℂ and consider thep-Sylow for any primep, or even the torsion part of ℂ*. LetHbe this subgroup.Hhas a complement, but this complement is found by Zorn's Lemma (consider a maximal subgroup that intersectsHtrivially) and the use of Zorn's Lemma is essential. In fact, by Zorn's Lemma, any subgroup that has a trivial intersection withHcan be extended to a complement ofH. Since ℂ* is abelian, these complements cannot be conjugated to each other. (shrink)

Set theory, it has been contended, developed from its beginnings through a progression ofmathematicalmoves, despite being intertwined with pronounced metaphysical attitudes and exaggerated foundational claims that have been held on its behalf. In this paper, the seminal results of set theory are woven together in terms of a unifying mathematical motif, one whose transmutations serve to illuminate the historical development of the subject. The motif is foreshadowed in Cantor's diagonal proof, and emerges in the interstices of the inclusion vs. membership (...) distinction, a distinction only clarified at the turn of this century, remarkable though this may seem. Russell runs with this distinction, but is quickly caught on the horns of his well-known paradox, an early expression of our motif. The motif becomes fully manifest through the study of functionsof the power set of a set into the set in the fundamental work of Zermelo on set theory. His first proof in 1904 of his Well-Ordering Theoremis a central articulation containing much of what would become familiar in the subsequent development of set theory. Afterwards, the motif is cast by Kuratowski as a fixed point theorem, one subsequently abstracted to partial orders by Bourbaki in connection with Zorn's Lemma. Migrating beyond set theory, that generalization becomes cited as the strongest of fixed point theorems useful in computer science.Section 1 describes the emergence of our guiding motif as a line of development from Cantor's diagonal proof to Russell's Paradox, fueled by the clarification of the inclusion vs. membership distinction. Section 2 engages the motif as fully participating in Zermelo's work on the Well-Ordering Theorem and as newly informing on Cantor's basic result that there is no bijection. Then Section 3 describes in connection with Zorn's Lemma the transformation of the motif into an abstract fixed point theorem, one accorded significance in computer science. (shrink)

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valuation in quantum mechanics as exemplified, in particular, by Kochen–Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event algebras. We show explicitly that the latter category is equipped with an object (...) of truth values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is inherent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical implications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. (shrink)

The “four-color” theorem seems to be generalizable as follows. The four-letter alphabet is sufficient to encode unambiguously any set of well-orderings including a geographical map or the “map” of any logic and thus that of all logics or the DNA plan of any alive being. Then the corresponding maximally generalizing conjecture would state: anything in the universe or mind can be encoded unambiguously by four letters. That admits to be formulated as a “four-letter theorem”, and thus one (...) can search for a properly mathematical proof of the statement. It would imply the “four colour theorem”, the proof of which many philosophers and mathematicians believe not to be entirely satisfactory for it is not a “human proof”, but intermediated by computers unavoidably since the necessary calculations exceed the human capabilities fundamentally. It is furthermore rather unsatisfactory because it consists in enumerating and proving all cases one by one. Sometimes, a more general theorem turns out to be much easier for proving including a general “human” method, and the particular and too difficult for proving theorem to be implied as a corollary in certain simple conditions. The same approach will be followed as to the four colour theorem, i.e. to be deduced more or less trivially from the “four-letter theorem” if the latter is proved. References are only classical and thus very well-known papers: their complete bibliographic description is omitted. (shrink)

Kurt Godel’s “Incompleteness Theorem” is generally seen as one of the three main achievements of modern logic in philosophy. However, in this article, three fundamental flaws in the theorem will be exposed about its concept, judgment and reasoning parts by analyzing the setting of the theorem, the process of demonstration and the extension of its conclusions. Thus through the analysis of the essence significance of the theorem, I think the theorem should be classified (...) as "liar paradox" or something like that. Therefore, the theorem is not reliable and then the content of the theorem itself is questionable. At the same time, please note, the root of the problem exposed in Godel's “Incompleteness Theorem” is a typical example o f existing loopholes in traditional logic. (shrink)

One can construct a mapping between Hilbert space and the class of all logic if the latter is defined as the set of all well-orderings of some relevant set (or class). That mapping can be further interpreted as a mapping of all states of all quantum systems, on the one hand, and all logic, on the other hand. The collection of all states of all quantum systems is equivalent to the world (the universe) as a whole. Thus that (...) mapping establishes a fundamentally philosophical correspondence between the physical world and universal logic by the meditation of a special and fundamental structure, that of Hilbert space, and therefore, between quantum mechanics and logic by mathematics. Furthermore, Hilbert space can be interpreted as the free variable of "quantum information" and any point in it, as a value of the same variable as "bound" already axiom of choice. (shrink)

The Craig Interpolation Theorem is a fundamental property of rst order logic L!!. What happens if we strengthen rst order logic? Second order logic L 2 satises Craig for trivial reasons but on the other hand, L 2 is not very interesting from a fundational point of view.

A traditional aspect of model theory has been the interplay between formal languages and mathematical structures. This dissertation is concerned, in particular, with the relationship between the languages of relevant logic and Routley-Meyer models. One fundamental question is treated: what is the expressive power of relevant languages in the Routley-Meyer framework? In the case of finitary relevant propositional languages, two answers are provided. The first is that finitary propositional relevant languages are the fragments of first order logic (...) preserved under relevant directed bisimulations. The second is that, when we restrict our attention to what can be labelled as De Morgan models, we can obtain an analogue of Lindström's theorem for finitary propositional relevant languages. Furthermore, it is shown that a preservation theorem characterizing the expressive power of infinitary relevant languages in classical infinitary languages follows as a consequence of an interpolation theorem for classical infinitary logic. In addition, algebraic characterizations of the classes of Routley-Meyer models axiomatizable in relevant propositional languages, incompactness of infinitary relevant propositional languages and the expressive power of quantificational relevant languages are discussed. A final chapter is devoted to the study of relevant languages as second order frame languages. In particular we devote our attention to the problem of which properties expressible by relevant languages are elementary and which are not. An algebraic characterization of such elementary properties together with some examples of non first order properties axiomatizable in relevant logic are given. Finally, a Sahlqvist-van Benthem algorithm showing that relevant formulas with a certain syntactic form express calculable first order properties at the level of frames is established. (shrink)

In this paper we analyze some aspects of the question of using methods from model theory to study structures of functional analysis.By a well known result of P. Lindström, one cannot extend the expressive power of first order logic and yet preserve its most outstanding model theoretic characteristics (e.g., compactness and the Löwenheim-Skolem theorem). However, one may consider extending the scope of first order in a different sense, specifically, by expanding the class of structures that are regarded as (...) models (e.g., including Banach algebras or other structures of functional analysis), and ask whether the resulting extensions of first order model theory preserve some of its desirable characteristics.A formal framework for the study of structures based on Banach spaces from the perspective of model theory was first introduced by C. W. Henson in [8] and [6]. Notions of syntax and semantics for these structures were defined, and it was shown that using them one obtains a model theoretic apparatus that satisfies many of the fundamental properties of first order model theory. For instance, one has compactness, Löwenheim-Skolem, and omitting types theorems. Further aspects of the theory, namely, the fundamentals of stability and forking, were first introduced in [10] and [9].The classes of mathematical structures formally encompassed by this framework are normed linear spaces, possibly expanded with additional structure,e.g., operations, real-valued relations, and constants. This notion subsumes wide classes of structures from functional analysis. However, the restriction that the universe of a structure be a normed space is not necessary. (This restriction has a historical, rather than technical origin; specifically, the development of the theory was originally motivated by questions in Banach space geometry.) Analogous techniques can be applied if the universe is a metric space. Now, when the underlying metric topology is discrete, the resulting model theory coincides with first order model theory, so this logic extends first order in the sense described above. Furthermore, without any cost in the mathematical complexity, one can also work in multi-sorted contexts, so, for instance, one sort could be an operator algebra while another is. say, a metric space. (shrink)

In this article I am going to argue for the possibility of a transcendental source of logic based on a phenomenologically motivated approach. My aim will be essentially carried out in two succeeding steps of reduction: the first one will be the indication of existence of an inherent temporal factor conditioning formal predicative discourse and the second one, based on a supplementary reduction of objective temporality, will be a recourse to a time-constituting origin which has to be assumed as (...) a non-temporal, transcendental subjectivity and for that reason as possibly the ultimate transcendental root of pure logic. In the development of the argumentation and taking into account W.V. Quine’s views in his well-known Word and Object, a special emphasis will be given to the fundamentally temporal character of universal and existential predicative forms, to their status in logical theories in general, and to their underlying role in generating an inherently non-finitistic character reflected, for instance, in the undecidability of certain infinity statements in formal mathematical theories. This is shown also to concern metatheorems of such vital importance as Gödel’s incompleteness theorems in mathematical foundations. Moreover in the course of the discussion the quest for the ultimate limits of predication will lead to the notions of separation and intentional correlation between an ‘observing’ subject and the object of ‘observation’ as well as to the notion of syntactical individuals taken as the irreducible non-analytic nuclei-forms within analytical discourse. (shrink)

In addition to this being the centenary of Kurt Gödel’s birth, January marked 75 years since the publication (1931) of his stunning incompleteness theorems. Though widely known in one form or another by practicing mathematicians, and generally thought to say something fundamental about the limits and potentialities of mathematical knowledge, the actual importance of these results for mathematics is little understood. Nor is this an isolated example among famous results. For example, not long ago, Philip Davis wrote me about (...) what he calls The Paradox of Irrelevance: “There are many math problems that have achieved the cachet of tremendous significance, e.g. Fermat, 4 color, Kepler’s packing, Gödel, etc. Of Fermat, I have read: ‘the most famous math problem of all time.’ Of Gödel, I have read: ‘the most mathematically significant achievement of the 20th century.’ … Yet, these problems have engaged the attention of relatively few research mathematicians—even in pure math.” What accounts for this disconnect between fame and relevance? Before going into the question for Gödel’s theorems, it should be distinguished in one respect from the other examples mentioned, which in any case form quite a mixed bag. Namely, each of the Fermat, 4 color, and Kepler’s packing problems posed a stand-out challenge following extended efforts to settle them; meeting the challenge in each case required new ideas or approaches and intense work, obviously of different degrees. By contrast, Gödel’s theorems were simply unexpected, and their proofs, though requiring novel techniques, were not difficult on the scale of things. Setting that aside, my view of Gödel’s incompleteness theorems is that their relevance to mathematical logic (and its offspring in the theory of computation) is paramount; further, their philosophical relevance is significant, but in just what way is far from settled; and finally, their mathematical relevance outside of logic is very much unsubstantiated but is the object of ongoing, tantalizing efforts.. (shrink)

In 1870 Jordan proved that the composition factors of two composition series of a group are the same. Almost 20 years later Hölder (1889) was able to extend this result by showing that the factor groups, which are quotient groups corresponding to the composition factors, are isomorphic. This result, nowadays called the Jordan-Hölder Theorem, is one of the fundamental theorems in the theory of groups. The fact that Jordan, who was working in the framework of substitution groups, was (...) able to prove only a part of this theorem is often used to emphasize the importance and even the necessity of the abstract conception of groups, which was employed by Hölder. However, as a little-known paper from 1873 reveals, Jordan had all the necessary ingredients to prove the Jordan-Hölder Theorem at his disposal (namely, composition series, quotient groups, and isomorphisms), and he also noted a connection between composition factors and corresponding quotient groups. Thus, I argue that the answer to the question posed in the title is “Yes.” It was not the lack of the abstract notion of groups which prevented Jordan from proving the Jordan-Hölder Theorem, but the fact that he did not ask the right research question that would have led him to this result. In addition, I suggest some reasons why this has been overlooked in the historiography of algebra, and I argue that, by hiding computational and cognitive complexities, abstraction has important pragmatic advantages. (shrink)

We propose a solution to the problem of logical omniscience in what we take to be its fundamental version: as concerning arbitrary agents and the knowledge attitude per se. Our logic of knowledge is a spin-off from a general theory of thick content, whereby the content of a sentence has two components: an intension, taking care of truth conditions; and a topic, taking care of subject matter. We present a list of plausible logical validities and invalidities for the (...) logic of knowledge per se for arbitrary agents, and isolate three explanatory factors for them: the topic-sensitivity of content; the fragmentation of knowledge states; the defeasibility of knowledge acquisition. We then present a novel dynamic epistemic logic that yields precisely the desired validities and invalidities, for which we provide expressivity and completeness results. We contrast this with related systems and address possible objections. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:The Logic Pamphlets of Charles Lutwidge Dodgson and Related PiecesIrving H. AnellisFrancine F. Abeles, editor. The Logic Pamphlets of Charles Lutwidge Dodgson and Related Pieces. The Pamphlets of Lewis Carroll, 4. New York-Charlottesville-London: Lewis Carroll Society of North America-University Press of Virginia, 2010. Pp. xx + 271. Cloth, $75.00.Until William Bartley’s rediscovery and reconstruction of Dodgson’s lost Part II of Symbolic Logic, Lewis Carroll’s reputation (...) in logic, when taken seriously, rested upon his few published articles on logical paradoxes and puzzles, while his published books, The Game of Logic and Symbolic Logic, were regarded as suitable perhaps as pedagogical tools, but dismissed otherwise as amusements, on a par with the Alice works. Richard Braithwaite asserted (“Lewis Carroll as Logician”) that “Carroll regarded formal and symbolic logic not as a corpus of systematic knowledge about valid thought nor yet as an art for teaching a person to think correctly.” He suggested that Dodgson used his pseudonym for his popular and whimsical writings, reserving his legal name only for his serious mathematical products. Philosophers practicing linguistic analysis in their assault on nonsense deriving from misuse of language meanwhile developed an interest in Carroll (e.g. George Pitcher, “Wittgenstein, Nonsense, and Lewis Carroll”). Abeles, on the contrary, stresses the seriousness of Dodgson’s pedagogical and popularizing mission (195–99).Bartley’s discovery opened the door for reevaluating Dodgson as a serious logician, and Abeles has been in the forefront of that reevaluation. Her general introduction and introductions to the main divisions of this collection of Carroll’s publications (and additional material from his Nachlass and a handful of publications of others, composed in response to Carroll’s published articles) place his serious logical work and its significance in historical perspective, providing a deeper, more sophisticated view than found in Bartley’s “Editor’s Introduction” to Lewis Carroll’s Symbolic Logic. Abeles also offers brief introductions to the individual entries, which describe their physical characteristics and circumstances of composition.Dodgson aligned with the majority of those British logicians of his day, starting with George Boole, who understood formal logic to be Aristotelian syllogistic, and symbolic logic to be syllogistic logic expressed algebraically. His notational innovation was employing indices to terms so that, independently of the arrangement of terms, propositions could easily be read; thus, “xy0” can be read as “no x are y” or “no y are x” and “x1y0” as “all x are not y” or “no x are y”. In dealing with the classical elimination problem in the class calculus—to determine the maximum information, without duplications, obtainable from a given set of premises—Dodgson in his later work and unpublished letters anticipated several concepts of automated theorem proving.Central to both geometry and to formal logic are the rules of logical inference that establish the validity of arguments and guarantee that conclusions inferred from true [End Page 506] premises are true. The modern analytic tableaux, or tree method, is a fundamental tool in this regard, both for deriving theorems and for determining the validity or invalidity of the proofs for propositional calculus and first-order predicate calculus.Introducing his reconstruction of Part II of Symbolic Logic, Bartley noted that, along with the logic diagrams that Carroll devised, he also devised a tableau method that strongly resembled Beth’s semantic tableaux. Abeles went more deeply and convincingly into that resemblance in her earlier research. Beth’s tableaux, together with Hintikka’s model sets, were the direct ancestors of Smullyan’s analytic tableaux, which in turn are the theoretical basis for the Robinson resolution method that continues to be central to much work in programming logic.Abeles has also shown that the work in Studies in Logic by Charles Peirce and his logic students at Johns Hopkins University served as a source of inspiration for Dodgson. More critically, she demonstrated that Dodgson devised and employed the tree method for carrying out proofs of syllogisms and chains of syllogisms, or soriteses, in Part II of Symbolic Logic (see her “Lewis Carroll’s Method of Trees: Its Origins in Studies in Logic,” Modern Logic 1 [1990]: 25–34). The tree... (shrink)

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)

A new formulation of what may be called the “fundamental theorem of the theory of relativity” is presented and proved in -space-time, based on the full classification of special transformations and the corresponding velocity addition laws. A system of axioms is introduced and discussed leading to the result, and a study is made of several variants of that system. In particular the status of the group axiom is investigated with respect to the condition of the two-way isotropy of (...) light. Several issues which are ignored or misunderstood in the literature are emphasized. (shrink)

I like the view that the fundamental facts are logically simple, not complex. However, some universal generalizations and negations may appear fundamental, because they cannot be explained by logically simple facts about particulars. I explore a natural reply: those universal generalizations and negations are true because certain logically simple facts—call them —are the fundamental facts. I argue that this solution is only available given some metaphysical frameworks, some conceptions of metaphysical explanation and fundamentality. It requires a ‘fitting’ (...) framework, according to which metaphysical theories explain the aptness of representations in terms of how things are fundamentally. Fitting frameworks conceive of the fundamental facts as those that are metaphysically ‘real’; call them the ‘facts-in-reality’. Moreover, we must take as primary a plural notion of the facts-in-reality, not the singular notion of a fact-in-reality. By contrast, a metaphysics that grounds facts is incompatible with my strategy for keeping the fundamental facts logically simple. (shrink)

We generalize the ultrapower in a way suitable for choiceless set theory. Given an ultrafilter, forcing is used to construct an extended ultrapower of the universe, designed so that the fundamental theorem of ultrapowers holds even in the absence of the axiom of choice. If, in addition, we assume DC, then an extended ultrapower of the universe by a countably complete ultrafilter must be well-founded. As an application, we prove the Vopěnka-Hrbáček theorem from ZF + DC only (...) (the proof of Vopěnka and Hrbáček used the full axiom of choice): if there exists a strongly compact cardinal, then the universe is not constructible from a set. The same method shows that, in L[ 2 ω ], there cannot exist a θ-compact cardinal less than θ (where θ is the least cardinal onto which the continuum cannot be mapped); a similar result can be proven for other models of the form L[ A ]. The result for L[ 2 ω ] is of particular interest in connection with the axiom of determinacy. The extended ultrapower construction of this paper is an improved version of the author's earlier pseudo-ultrapower method, making use of forcing rather than the omitting types theorem. (shrink)

Any attempt to construct a realist interpretation of quantum theory founders on the Kochen-Specker theorem, which asserts the impossibility of assigning values to quantum quantities in a way that preserves functional relations between them. We construct a new type of valuation which is defined on all operators, and which respects an appropriate version of the functional composition principle. The truth-values assigned to propositions are (i) contextual; and (ii) multi-valued, where the space of contexts and the multi-valued logic for (...) each context come naturally from the topos theory of presheaves. The first step in our theory is to demonstrate that the Kochen-Specker theorem is equivalent to the statement that a certain presheaf defined on the category of self-adjoint operators has no global elements. We then show how the use of ideas drawn from the theory of presheaves leads to the definition of a generalised valuation in quantum theory whose values are sieves of operators. In particular, we show how each quantum state leads to such a generalised valuation. A key ingredient throughout is the idea that, in a situation where no normal truth-value can be given to a proposition asserting that the value of a physical quantity A lies in a set D of real numbers , it is nevertheless possible to ascribe a partial truth-value which is determined by the set of all coarse-grained propositions that assert that some function f(A) lies in f(D), and that are true in a normal sense. The set of all such coarse-grainings forms a sieve on the category of self-adjoint operators, and is hence fundamentally related to the theory of presheave. (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)

Carl Hempel introduced what he called "Craig's theorem" into the philosophy of science in a famous discussion of the "problem of theoretical terms." Beginning with Hempel's use of 'Craig's theorem," I shall bring out some of the key differences between Hempel's treatment of the "problem of theoretical terms" and Carnap's in order to illuminate the peculiar function of Wissenschaftslogik in Carnap's mature philosophy. Carnap's treatment, in particular, is fundamentally antimetaphysical—he aims to use the tools of mathematical logic (...) to dissolve rather solve traditional philosophical problems—and it is precisely this point that is missed by his logically-minded contemporaries such as Hempel and Quine. (shrink)

How the concept of proof has enabled the creation of mathematical knowledge. The Story of Proof investigates the evolution of the concept of proof--one of the most significant and defining features of mathematical thought--through critical episodes in its history. From the Pythagorean theorem to modern times, and across all major mathematical disciplines, John Stillwell demonstrates that proof is a mathematically vital concept, inspiring innovation and playing a critical role in generating knowledge. Stillwell begins with Euclid and his influence on (...) the development of geometry and its methods of proof, followed by algebra, which began as a self-contained discipline but later came to rival geometry in its mathematical impact. In particular, the infinite processes of calculus were at first viewed as "infinitesimal algebra," and calculus became an arena for algebraic, computational proofs rather than axiomatic proofs in the style of Euclid. Stillwell proceeds to the areas of number theory, non-Euclidean geometry, topology, and logic, and peers into the deep chasm between natural number arithmetic and the real numbers. In its depths, Cantor, Gödel, Turing, and others found that the concept of proof is ultimately part of arithmetic. This startling fact imposes fundamental limits on what theorems can be proved and what problems can be solved. Shedding light on the workings of mathematics at its most fundamental levels, The Story of Proof offers a compelling new perspective on the field's power and progress. (shrink)

72 1024x768 This paper presents evidence from the fields of cognitive science and quantum information theory suggesting quantum theory to be the dominant fundamental logic in the natural world, in direct challenge to the long-held assumption that quantum logic only need be considered ‘in the quantum realm.' A summary of the evolution of quantum logic and quantum theory is presented, along with an overview for the necessity of incomplete quantum knowledge, and some representative aspects of quantum (...) logic. A case can be made that classical logic and theory is a subset of quantum logic and theory, given that elements of quantum physics exist that can never admit classical understanding, including: Bell's theorem, Hardy's theorem, and the Pusey-Barrett-Rudolph theorem. Support can be found for the primacy of quantum logic in the natural world in the cognitive sciences, where recent research studies recognize quantum logic in studies of: the subconscious, decisions involving unknown interconnected variables, memory, and question sequencing. Normal 0 false false false EN-US X-NONE X-NONE. (shrink)

This book uses the friendly format of the computing language Prolog to teach a full formal predicate logic. With Prolog, the scope and limits of both logic and computing can be explored and experimented. Students learning formal logic in a Prolog format can begin using their already developed informal abilities in logic to program in Prolog and conversely learn enough formal logic to examine Prolog and computing in general so major fundamental theorems can be (...) demonstrated. Cases such as Church's Thesis, Church's Theorem, Turing's Halting Problem, and Godel's Incompleteness Theorem provide the author with the means to assess some of the philosophical implications of logic and computing. Henry designed the book for undergraduate students, but it is also useful for philosophers and theologians who wish to see how computer programming serves as a probe into philosophical matters. Contents: The Formalization of Logic; Propositional Logic; Predicate Logic; Prolog: Programming in Logic; Logic Machines; The Scope and Limits of Logic and Logic Machines; Philosophical Reflections; Appendix; Bibliography; Index. (shrink)