View topic on PhilPapers for more information
Related categories

70 found
Order:
More results on PhilPapers
1 — 50 / 70
  1. added 2020-06-10
    On Representations of Intended Structures in Foundational Theories.Neil Barton, Moritz Müller & Mihai Prunescu - manuscript
    Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. added 2020-05-26
    Forms of Structuralism: Bourbaki and the Philosophers.Jean-Pierre Marquis - forthcoming - In Alberto Peruzzi & Silvano Zipoli Caiani (eds.), Structures Meres, Semantics, Mathematics, and Cognitive Science. New York, NY, USA:
    In this paper, we argue that, contrary to the view held by most philosophers of mathematics, Bourbaki’s technical conception of mathematical structuralism is relevant to philosophy of mathematics. In fact, we believe that Bourbaki has captured the core of any mathematical structuralism.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. added 2020-05-02
    Doing the Math: Comparing Ontario and Singapore Mathematics Curriculum at the Primary Level.Dieu Trang Hoang - 2020 - Dissertation, Brock University
    This paper sought to investigate the fundamental differences in mathematics education through a comparison of curriculum of 2 countries—Singapore and Canada (as represented by Ontario)—in order to discover what the Ontario education system may learn from Singapore in terms of mathematics education. Mathematics curriculum were collected for Grades 1 to 8 for Ontario, and the equivalent in Singapore. The 2 curriculums were textually analyzed based on both the original and the revised Bloom’s taxonomy to expose their foci. The difference in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. added 2020-03-24
    Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - manuscript
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. added 2020-03-08
    Structural Relativity and Informal Rigour.Neil Barton - forthcoming - In Objects, Structures, and Logics, FilMat Studies in the Philosophy of Mathematics.
    Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6. added 2020-01-15
    Theories Are Not Partially Ordered.Thomas William Barrett & Hans Halvorson - manuscript
    This paper presents a simple example of first-order theories T1 and T2 such that i) T1 can be embedded in T2 and vice versa, ii) T1 posits all of the structure of T2 and vice versa, but iii) T1 and T2 are not equivalent. This shows that theories lack both the Cantor-Bernstein and co-Cantor-Bernstein properties and are neither partially ordered by the relation 'is embeddable in' nor by 'posits all of the structure of'. In addition, these results clarify the overall (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. added 2020-01-07
    Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic. 2nd Ed.Luis M. Augusto - 2020 - London: College Publications.
    This is the 2nd edition of Computational logic. Vol. 1: Classical deductive computing with classical logic. This edition has a wholly new chapter on Datalog, a hard nut to crack from the viewpoint of semantics when negation is included.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. added 2019-09-20
    There is No Standard Model of ZFC and ZFC2. Part II.Jaykov Foukzon & Elena Men’Kova - 2019 - Advanced in Pure Mathematic 9 (9):685-744.
    In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models or nonstandard model with standard part. An posible generalization of Lob’s theorem is considered.Main results are: (i) ConZFC  Mst ZFC, (ii) ConZF  V  L, (iii) ConNF  Mst NF, (iv) ConZFC2, (v) let k be inaccessible cardinal then ConZFC  .
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. added 2019-09-20
    There is No Standard Model of ZFC and ZFC_2. Part I.Jaykov Foukzon - 2017 - Journal of Advances in Mathematics and Computer Science 2 (26):1-20.
    In this paper we view the first order set theory ZFC under the canonical frst order semantics and the second order set theory ZFC_2 under the Henkin semantics. Main results are: (i) Let M_st^ZFC be a standard model of ZFC, then ¬Con(ZFC + ∃M_st^ZFC ). (ii) Let M_stZFC_2 be a standard model of ZFC2 with Henkin semantics, then ¬Con(ZFC_2 +∃M_stZFC_2). (iii) Let k be inaccessible cardinal then ¬Con(ZFC + ∃κ). In order to obtain the statements (i) and (ii) examples of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. added 2019-09-18
    Repairing Ontologies Via Axiom Weakening.Daniele Porello & Oliver Kutz Nicolas Troquard, Roberto Confalonieri, Pietro Galliani, Rafael Peñaloza, Daniele Porello - 2018 - In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18). pp. 1981--1988.
    Ontology engineering is a hard and error-prone task, in which small changes may lead to errors, or even produce an inconsistent ontology. As ontologies grow in size, the need for automated methods for repairing inconsistencies while preserving as much of the original knowledge as possible increases. Most previous approaches to this task are based on removing a few axioms from the ontology to regain consistency. We propose a new method based on weakening these axioms to make them less restrictive, employing (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. added 2019-08-23
    On the Reconciliation Between Infinity and Zero - Another 'Theory of Everything' Based on Nothing?Louis Taylor - manuscript
    Is there room enough in all creation for an 'Empty Universe Theory'? How should we view the realm in which we exist? Are the natures of matter and energy, their compositions and relationships with each other the fundamental key to the understanding of everything or is it something else? A thought on the true nature of the realm we really inhabit with some basic mathematical description of the relationship between the finite and the absolute as we are capable of understanding (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. added 2019-08-03
    Concerning Formal Concept Analysis on Complete Residuated Lattices.Abner de Mattos Brito - 2019 - Dissertation, University of Campinas, Brazil
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. added 2019-07-10
    The Well-Ordered Society Under Crisis: A Formal Analysis of Public Reason Vs. Convergence Discourse.Hun Chung - forthcoming - American Journal of Political Science:1-20.
    A well-ordered society faces a crisis whenever a sufficient number of noncompliers enter into the political system. This has the potential to destabilize liberal democratic political order. This article provides a formal analysis of two competing solutions to the problem of political stability offered in the public reason liberalism literature—namely, using public reason or using convergence discourse to restore liberal democratic political order in the well-ordered society. The formal analyses offered in this article show that using public reason fails completely, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. added 2019-07-02
    Sofia A. Yanovskaya: The Marxist Pioneer of Mathematical Logic in the Soviet Union.Dimitris Kilakos - 2019 - Transversal: International Journal for the Historiography of Science 6:49-64.
    K. Marx’s 200th jubilee coincides with the celebration of the 85 years from the first publication of his “Mathematical Manuscripts” in 1933. Its editor, Sofia Alexandrovna Yanovskaya (1896–1966), was a renowned Soviet mathematician, whose significant studies on the foundations of mathematics and mathematical logic, as well as on the history and philosophy of mathematics are unduly neglected nowadays. Yanovskaya, as a militant Marxist, was actively engaged in the ideological confrontation with idealism and its influence on modern mathematics and their interpretation. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. added 2019-06-06
    Extension, Translation, and the Cantor-Bernstein Property.Thomas William Barrett & Hans Halvorson - manuscript
    The purpose of this paper is to examine in detail a particularly interesting pair of first-order theories. In addition to clarifying the overall geography of notions of equivalence between theories, this simple example yields two surprising conclusions about the relationships that theories might bear to one another. In brief, we see that theories lack both the Cantor-Bernstein and co-Cantor-Bernstein properties.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  16. added 2019-06-06
    The Contemporary Relevance of Ancient Logical Theory.John Corcoran - 1982 - Philosophical Quarterly 32 (126):76.
    This interesting and imaginative monograph is based on the author’s PhD dissertation supervised by Saul Kripke. It is dedicated to Timothy Smiley, whose interpretation of PRIOR ANALYTICS informs its approach. As suggested by its title, this short work demonstrates conclusively that Aristotle’s syllogistic is a suitable vehicle for fruitful discussion of contemporary issues in logical theory. Aristotle’s syllogistic is represented by Corcoran’s 1972 reconstruction. The review studies Lear’s treatment of Aristotle’s logic, his appreciation of the Corcoran-Smiley paradigm, and his understanding (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  17. added 2019-04-04
    Incompleteness and Computability. An Open Introduction to Gödel's Theorems.Richard Zach - 2019
    Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. added 2019-04-04
    Sets, Logic, Computation. An Open Introduction to Metalogic.Richard Zach - 2017
    An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. added 2019-04-02
    Categories of First -Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - Lvov-Warsaw School. Past and Present.
    One well known problem regarding quantifiers, in particular the 1st order quantifiers, is connected with their syntactic categories and denotations.The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial languages generated (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  20. added 2019-04-02
    On the Mutual Definability of the Notions of Entailment, Rejection, and Inconsistency.Urszula Wybraniec-Skardowska - 2016 - Axioms 5 (15).
    In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author has proved (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  21. added 2019-04-02
    Teoria zdań odrzuconych.Urszula Wybraniec-Skardowska - 1969 - Dissertation, Opole University
    This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  22. added 2019-03-24
    The Lvov-Warsaw School. Past and Present.Urszula Wybraniec-Skardowska & Ángel Garrido (eds.) - 2018 - Cham, Switzerland: Springer- Birkhauser,.
    This is a collection of new investigations and discoveries on the history of a great tradition, the Lvov-Warsaw School of logic , philosophy and mathematics, by the best specialists from all over the world. The papers range from historical considerations to new philosophical, logical and mathematical developments of this impressive School, including applications to Computer Science, Mathematics, Metalogic, Scientific and Analytic Philosophy, Theory of Models and Linguistics.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  23. added 2019-03-15
    Combining Algebraizable Logics.A. Jánossy, Á Kurucz & Á. E. Eiben - 1996 - Notre Dame Journal of Formal Logic 37 (2):366-380.
    The general methodology of "algebraizing" logics is used here for combining different logics. The combination of logics is represented as taking the colimit of the constituent logics in the category of algebraizable logics. The cocompleteness of this category as well as its isomorphism to the corresponding category of certain first-order theories are proved.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  24. added 2018-11-21
    On the Concept of a Notational Variant.Alexander W. Kocurek - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction (LORI 2017, Sapporo, Japan). pp. 284-298.
    In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The definition of compositionality these (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  25. added 2018-09-13
    Complexity of Judgment Aggregation.Ulle Endriss, Umberto Grandi & Daniele Porello - 2012 - Journal of Artificial Intelligence Research 45:481--514.
    We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  26. added 2018-08-06
    Rejection in Łukasiewicz's and Słupecki's Sense.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Basel, Switzerland: pp. 575-597.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. added 2018-07-11
    Computational Reverse Mathematics and Foundational Analysis.Benedict Eastaugh - manuscript
    Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  28. added 2018-05-11
    What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. added 2018-05-01
    Willard Van Orman Quine's Philosophical Development in the 1930s and 1940s.Frederique Janssen-Lauret - 2018 - In Walter Carnielli, Frederique Janssen-Lauret & William Pickering (eds.), The Significance of the New Logic. Cambridge: Cambridge University Press.
    As analytic philosophy is becoming increasingly aware of and interested in its own history, the study of that field is broadening to include, not just its earliest beginnings, but also the mid-twentieth century. One of the towering figures of this epoch is W.V. Quine (1908-2000), champion of naturalism in philosophy of science, pioneer of mathematical logic, trying to unite an austerely physicalist theory of the world with the truths of mathematics, psychology, and linguistics. Quine's posthumous papers, notes, and drafts revealing (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. added 2018-04-18
    Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic.Luis M. Augusto - 2018 - London: College Publications.
    This is the first of a two-volume work combining two fundamental components of contemporary computing into classical deductive computing, a powerful form of computation, highly adequate for programming and automated theorem proving, which, in turn, have fundamental applications in areas of high complexity and/or high security such as mathematical proof, software specification and verification, and expert systems. Deductive computation is concerned with truth-preservation: This is the essence of the satisfiability problem, or SAT, the central computational problem in computability and complexity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  31. added 2018-03-22
    Logic and Sense.Urszula Wybraniec-Skardowska - 2016 - Philosophy Study 6 (9).
    In the paper, original formal-logical conception of syntactic and semantic: intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically: in the spirit of some Husserl’s ideas of pure grammar, Leśniewski-Ajukiewicz’s theory syntactic/semantic categories and in accordance with Frege’s ontological canons, Bocheński’s famous motto—syntax mirrors ontology and some ideas of Suszko: language should be a linguistic scheme of ontological reality and simultaneously a tool of its (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  32. added 2018-03-15
    Set Existence Principles and Closure Conditions: Unravelling the Standard View of Reverse Mathematics.Benedict Eastaugh - 2019 - Philosophia Mathematica 27 (2):153-176.
    It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  33. added 2018-03-05
    Torkel Franzén, Gödel's Theorem: An Incomplete Guide to its Use and Abuse. [REVIEW]R. Zach - 2005 - History and Philosophy of Logic 26 (4):369-371.
    On the heels of Franzén's fine technical exposition of Gödel's incompleteness theorems and related topics (Franzén 2004) comes this survey of the incompleteness theorems aimed at a general audience. Gödel's Theorem: An Incomplete Guide to its Use and Abuse is an extended and self-contained exposition of the incompleteness theorems and a discussion of what informal consequences can, and in particular cannot, be drawn from them.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  34. added 2018-01-18
    Temporal Justification Logic.S. Bucheli, M. Ghari & T. Studer - 2017 - Proceedings of the Ninth Workshop on Methods for Modalities (M4M9 2017), Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017, Electronic Proceedings in Theoretical Computer Science 243, Pages 59–74.
    Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be replaced with an appropriate justification logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. added 2018-01-02
    Natural Deduction for Diagonal Operators.Fabio Lampert - 2017 - In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics: The CSHPM 2016 Annual Meeting in Calgary, Alberta. Cham: Birkhäuser. pp. 39-51.
    We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some point (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  36. added 2017-11-26
    From Logical Calculus to Logical Formality—What Kant Did with Euler’s Circles.Huaping Lu-Adler - 2017 - In Corey W. Dyck & Falk Wunderlich (eds.), Kant and His German Contemporaries : Volume 1, Logic, Mind, Epistemology, Science and Ethics. Cambridge: Cambridge University Press. pp. 35-55.
    John Venn has the “uneasy suspicion” that the stagnation in mathematical logic between J. H. Lambert and George Boole was due to Kant’s “disastrous effect on logical method,” namely the “strictest preservation [of logic] from mathematical encroachment.” Kant’s actual position is more nuanced, however. In this chapter, I tease out the nuances by examining his use of Leonhard Euler’s circles and comparing it with Euler’s own use. I do so in light of the developments in logical calculus from G. W. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  37. added 2017-10-21
    Frege's Begriffsschrift is Indeed First-Order Complete.Yang Liu - 2017 - History and Philosophy of Logic 38 (4):342-344.
    It is widely taken that the first-order part of Frege's Begriffsschrift is complete. However, there does not seem to have been a formal verification of this received claim. The general concern is that Frege's system is one axiom short in the first-order predicate calculus comparing to, by now, the standard first-order theory. Yet Frege has one extra inference rule in his system. Then the question is whether Frege's first-order calculus is still deductively sufficient as far as the first-order completeness is (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  38. added 2017-10-10
    Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Arnold Beckmann, Ulrich Berger, Benedikt Löwe & John V. Tucker (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Berlin: Springer. pp. 575--583.
    Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. added 2017-10-10
    Kurt Gödel, Paper on the Incompleteness Theorems (1931).Richard Zach - 2004 - In Ivor Grattan-Guinness (ed.), Landmark Writings in Mathematics. Amsterdam: North-Holland. pp. 917-925.
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  40. added 2017-10-10
    Approximating Propositional Calculi by Finite-Valued Logics.Matthias Baaz & Richard Zach - 1994 - In 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. Los Alamitos: IEEE Press. pp. 257–263.
    The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  41. added 2017-05-31
    Many-Valued Logics. A Mathematical and Computational Introduction.Luis M. Augusto - 2020 - London: College Publications.
    2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  42. added 2017-05-01
    Mathematical Thinking Undefended on The Level of The Semester for Professional Mathematics Teacher Candidates. Toheri & Widodo Winarso - 2017 - Munich University Library.
    Mathematical thinking skills are very important in mathematics, both to learn math or as learning goals. Thinking skills can be seen from the description given answers in solving mathematical problems faced. Mathematical thinking skills can be seen from the types, levels, and process. Proportionally questions given to students at universities in Indonesia (semester I, III, V, and VII). These questions are a matter of description that belong to the higher-level thinking. Students choose 5 of 8 given problem. Qualitatively, the answers (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  43. added 2017-02-26
    Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
    The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  44. added 2017-02-17
    La Logique Symbolique En Débat À Oxford À la Fin du XIXe Siècle : Les Disputes Logiques de Lewis Carroll Et John Cook Wilson.Mathieu Marion & Amirouche Moktefi - 2014 - Revue D’Histoire des Sciences 67 (2):185-205.
    The development of symbolic logic is often presented in terms of a cumulative story of consecutive innovations that led to what is known as modern logic. This narrative hides the difficulties that this new logic faced at first, which shaped its history. Indeed, negative reactions to the emergence of the new logic in the second half of the nineteenth century were numerous and we study here one case, namely logic at Oxford, where one finds Lewis Carroll, a mathematical teacher who (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  45. added 2017-01-27
    Logic in the Tractatus.Max Weiss - 2017 - Review of Symbolic Logic 10 (1):1-50.
    I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  46. added 2017-01-12
    Logical Consequences. Theory and Applications: An Introduction.Luis M. Augusto - 2020 - London: College Publications.
    2nd edition. The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  47. added 2016-12-25
    Epistemology of Logic - Logic-Dialectic or Theory of the Knowledge.Epameinondas Xenopoulos - 1998 - Dissertation,
    1994.Επιστημολογία της Λογικής. Συγγραφέας Επαμεινώνδας Ξενόπουλος Μοναδική μελέτη και προσέγγιση της θεωρίας της γνώσης, για την παγκόσμια βιβλιογραφία, της διαλεκτικής πορείας της σκέψης από την λογική πλευρά της και της μελλοντικής μορφής που θα πάρουν οι διαλεκτικές δομές της, στην αδιαίρετη ενότητα γνωσιοθεωρίας, λογικής και διαλεκτικής, με την «μέθοδο του διαλεκτικού υλισμού». Έργο βαρύ με θέμα εξαιρετικά δύσκολο διακατέχεται από πρωτοτυπία και ζωντάνια που γοητεύει τον κάθε ανήσυχο στοχαστή από τις πρώτες γραμμές.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  48. added 2016-09-21
    Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  49. added 2016-08-26
    The Epsilon Calculus and Herbrand Complexity.Georg Moser & Richard Zach - 2006 - Studia Logica 82 (1):133-155.
    Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  50. added 2016-05-19
    INVENTING LOGIC: THE LÖWENHEIM-SKOLEM THEOREM AND FIRST- AND SECOND-ORDER LOGIC.Valérie Lynn Therrien - 2012 - Pensées Canadiennes 10.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
1 — 50 / 70