Results for 'Propositional Logic Arithmetization, Bivalued Logic Complete Arithmetization, Deductive Projection, Logical Retrojection, Logical Progeniture, Universal Logical Gate'

966 found
Order:
  1. Logic, mathematics, physics: from a loose thread to the close link: Or what gravity is for both logic and mathematics rather than only for physics.Vasil Penchev - 2023 - Astrophysics, Cosmology and Gravitation Ejournal 2 (52):1-82.
    Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2. complete enumerative inductions.John Corcoran - 2006 - Bulletin of Symbolic Logic 12:465-6.
    Consider the following. The first is a one-premise argument; the second has two premises. The question sign marks the conclusions as such. -/- Matthew, Mark, Luke, and John wrote Greek. ? Every evangelist wrote Greek. -/- Matthew, Mark, Luke, and John wrote Greek. Every evangelist is Matthew, Mark, Luke, or John. ? Every evangelist wrote Greek. -/- The above pair of premise-conclusion arguments is of a sort familiar to logicians and philosophers of science. In each case the first premise is (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  8
    Elementary Applied Symbolic Logic.Bangs Tapscott - 1976 - Englewood Cliffs, NJ, USA: Prentice-Hall.
    Elementary Applied Symbolic Logic was first published by Prentice-Hall in 1976. It went through two editions with them, then had a successful classroom run of 25 years by various publishers, before it finally went out of print in 2001.I am reviving it here, because during its run it acquired a reputation as an outstanding textbook for getting students to understand symbolic logic.I immodestly believe it is the best textbook ever written on the subject.------------This is a book on applied (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  38
    Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
    This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then (...)
    Direct download  
     
    Export citation  
     
    Bookmark   22 citations  
  5. How to prove the consistency of arithmetic.Jaakko Hintikka & Besim Karakadilar - 2006 - Acta Philosophica Fennica 78:1.
    It is argued that the goal of Hilbert's program was to prove the model-theoretical consistency of different axiom systems. This Hilbert proposed to do by proving the deductive consistency of the relevant systems. In the extended independence-friendly logic there is a complete proof method for the contradictory negations of independence-friendly sentences, so the existence of a single proposition that is not disprovable from arithmetic axioms can be shown formally in the extended independence-friendly logic. It can also (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  14
    Propositional Logic: Deduction and Algorithms.Anthony Hunter - 1999 - Cambridge University Press.
    This account of propositional logic concentrates on the algorithmic translation of important methods, especially of decision procedures for (subclasses of) propositional logic. Important classical results and a series of new results taken from the fields of normal forms, satisfiability and deduction methods are arranged in a uniform and complete theoretic framework. The algorithms presented can be applied to VLSI design, deductive databases and other areas. After introducing the subject the authors discuss satisfiability problems and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  47
    Algebraic Logic Perspective on Prucnal’s Substitution.Alex Citkin - 2016 - Notre Dame Journal of Formal Logic 57 (4):503-521.
    A term td is called a ternary deductive term for a variety of algebras V if the identity td≈r holds in V and ∈θ yields td≈td for any A∈V and any principal congruence θ on A. A connective f is called td-distributive if td)≈ f,…,td). If L is a propositional logic and V is a corresponding variety that has a TD term td, then any admissible in L rule, the premises of which contain only td-distributive operations, is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  83
    A Formalization of Set Theory Without Variables.István Németi - 1988 - American Mathematical Soc..
    Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   47 citations  
  9. Many-valued logics and Suszko's thesis revisited.Marcelo Tsuji - 1998 - Studia Logica 60 (2):299-309.
    Suszko's Thesis maintains that many-valued logics do not exist at all. In order to support it, R. Suszko offered a method for providing any structural abstract logic with a complete set of bivaluations. G. Malinowski challenged Suszko's Thesis by constructing a new class of logics (called q-logics by him) for which Suszko's method fails. He argued that the key for logical two-valuedness was the "bivalent" partition of the Lindenbaum bundle associated with all structural abstract logics, while his (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  10.  67
    Hereditarily Structurally Complete Superintuitionistic Deductive Systems.Alex Citkin - 2018 - Studia Logica 106 (4):827-856.
    Propositional logic is understood as a set of theorems defined by a deductive system: a set of axioms and a set of rules. Superintuitionistic logic is a logic extending intuitionistic propositional logic \. A rule is admissible for a logic if any substitution that makes each premise a theorem, makes the conclusion a theorem too. A deductive system \ is structurally complete if any rule admissible for the logic defined (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Disbelief Logic Complements Belief Logic.John Corcoran & Wagner Sanz - 2008 - Bulletin of Symbolic Logic 14 (3):436.
    JOHN CORCORAN AND WAGNER SANZ, Disbelief Logic Complements Belief Logic. Philosophy, University at Buffalo, Buffalo, NY 14260-4150 USA E-mail: corcoran@buffalo.edu Filosofia, Universidade Federal de Goiás, Goiás, GO 74001-970 Brazil E-mail: sanz@fchf.ufg.br -/- Consider two doxastic states belief and disbelief. Belief is taking a proposition to be true and disbelief taking it to be false. Judging also dichotomizes: accepting a proposition results in belief and rejecting in disbelief. Stating follows suit: asserting a proposition conveys belief and denying conveys disbelief. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  27
    Completeness of Pledger’s modal logics of one-sorted projective and elliptic planes.Rob Goldblatt - 2021 - Australasian Journal of Logic 18 (4).
    Ken Pledger devised a one-sorted approach to the incidence relation of plane geometries, using structures that also support models of propositional modal logic. He introduced a modal system 12g that is valid in one-sorted projective planes, proved that it has finitely many non-equivalent modalities, and identified all possible modality patterns of its extensions. One of these extensions 8f is valid in elliptic planes. These results were presented in his 1980 doctoral dissertation, which is reprinted in this issue of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Propositional Functions in Extension.Robert Trueman - 2011 - Theoria 77 (4):292-311.
    In his “The Foundations of Mathematics”, Ramsey attempted to marry the Tractarian idea that all logical truths are tautologies and vice versa, and the logicism of the Principia. In order to complete his project, Ramsey was forced to introduce propositional functions in extension (PFEs): given Ramsey's definitions of 1 and 2, without PFEs even the quantifier-free arithmetical truth that 1 ≠ 2 is not a tautology. However, a number of commentators have argued that the notion of PFEs (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  14.  66
    Krajíček Jan. Bounded arithmetic, propositional logic, and complexity theory. Encyclopedia of mathematics and its applications, vol. 60. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1995, xiv + 343 pp. [REVIEW]P. Clote - 1999 - Journal of Symbolic Logic 64 (3):1357-1362.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  15.  45
    Muhammed b. Yûsuf es-Senûsî’nin Kel'm Anlayışında M'rifetullah-Akıl İlişkisi.Ahmet Çelik - 2017 - Cumhuriyet İlahiyat Dergisi 21 (2):1355-1382.
    : Muḥammad ibn Yūsuf al-Sanūsī, who was one of the theologian of later Muslim Asʿharī theologians, is one of the scholar came to the fore in Maghrib. Although al-Sanūsī shapes his thoughts within the Asʿharī’s kalam system, he presents new contributions to this system with his own unique perspective. In particular, his effort to give importance to reason in maʿrifat Allāh is remarkable. According to him, maʿrifat Allāh can only be reached with reflection. Also the reflection is waʿẓ or contexture (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  16.  86
    LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science.Andrea Iacona - 2021 - Springer.
    This textbook is a logic manual which includes an elementary course and an advanced course. It covers more than most introductory logic textbooks, while maintaining a comfortable pace that students can follow. The technical exposition is clear, precise and follows a paced increase in complexity, allowing the reader to get comfortable with previous definitions and procedures before facing more difficult material. The book also presents an interesting overall balance between formal and philosophical discussion, making it suitable for both (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  10
    Znanost, družba, vrednote =.A. Ule - 2006 - Maribor: Založba Aristej.
    In this book, I will discuss three main topics: the roots and aims of scientific knowledge, scientific knowledge in society, and science and values I understand scientific knowledge as being a planned and continuous production of the general and common knowledge of scientific communities. I begin my discussion with a brief analysis of the main differences between sciences, on the one hand, and everyday experience, philosophies, religions, and ideologies, on the other. I define the concept of science as a set (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  15
    Logic and discrete mathematics: a concise introduction.Willem Conradie - 2015 - Hoboken, NJ, USA: Wiley. Edited by Valentin Goranko.
    A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  36
    A Hilbert-Style Axiomatisation for Equational Hybrid Logic.Luís S. Barbosa, Manuel A. Martins & Marta Carreteiro - 2014 - Journal of Logic, Language and Information 23 (1):31-52.
    This paper introduces an axiomatisation for equational hybrid logic based on previous axiomatizations and natural deduction systems for propositional and first-order hybrid logic. Its soundness and completeness is discussed. This work is part of a broader research project on the development a general proof calculus for hybrid logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20. Completeness of an ancient logic.John Corcoran - 1972 - Journal of Symbolic Logic 37 (4):696-702.
    In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   85 citations  
  21. Meillassoux’s Virtual Future.Graham Harman - 2011 - Continent 1 (2):78-91.
    continent. 1.2 (2011): 78-91. This article consists of three parts. First, I will review the major themes of Quentin Meillassoux’s After Finitude . Since some of my readers will have read this book and others not, I will try to strike a balance between clear summary and fresh critique. Second, I discuss an unpublished book by Meillassoux unfamiliar to all readers of this article, except those scant few that may have gone digging in the microfilm archives of the École normale (...)
     
    Export citation  
     
    Bookmark   2 citations  
  22.  6
    Two applications of logic to mathematics.Gaisi Takeuti - 1978 - [Princeton, N.J.]: Princeton University Press.
    Using set theory in the first part of his book, and proof theory in the second, Gaisi Takeuti gives us two examples of how mathematical logic can be used to obtain results previously derived in less elegant fashion by other mathematical techniques, especially analysis. In Part One, he applies Scott- Solovay's Boolean-valued models of set theory to analysis by means of complete Boolean algebras of projections. In Part Two, he develops classical analysis including complex analysis in Peano's arithmetic, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   42 citations  
  23. ARISTOTELIAN LOGIC AND EUCLIDEAN GEOMETRY.John Corcoran - 2014 - Bulletin of Symbolic Logic 20 (1):131-2.
    John Corcoran and George Boger. Aristotelian logic and Euclidean geometry. Bulletin of Symbolic Logic. 20 (2014) 131. -/- By an Aristotelian logic we mean any system of direct and indirect deductions, chains of reasoning linking conclusions to premises—complete syllogisms, to use Aristotle’s phrase—1) intended to show that their conclusions follow logically from their respective premises and 2) resembling those in Aristotle’s Prior Analytics. Such systems presuppose existence of cases where it is not obvious that the conclusion (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  24.  76
    Admissibility of logical inference rules.Vladimir Vladimir Rybakov - 1997 - New York: Elsevier.
    The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically (...)
    Direct download  
     
    Export citation  
     
    Bookmark   41 citations  
  25. A propositional logic with explicit fixed points.Albert Visser - 1981 - Studia Logica 40 (2):155 - 175.
    This paper studies a propositional logic which is obtained by interpreting implication as formal provability. It is also the logic of finite irreflexive Kripke Models.A Kripke Model completeness theorem is given and several completeness theorems for interpretations into Provability Logic and Peano Arithmetic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   67 citations  
  26.  46
    Minimal Complete Propositional Natural Deduction Systems.Amr Elnashar & Wafik Boulos Lotfallah - 2018 - Journal of Philosophical Logic 47 (5):803-815.
    For each truth-functionally complete set of connectives, we construct a sound and complete natural deduction system containing no axioms and the smallest possible number of inference rules, namely one.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27.  29
    A decompositional deduction system for a logic featuring inconsistency and uncertainty.Beata Konikowska - 2005 - Journal of Applied Non-Classical Logics 15 (1):25-44.
    The paper discusses a four-valued propositional logic FOUR≤, similar to Belnap's logic, which can be used to describe incomplete or inconsistent knowledge. In addition to the two classical logical values tt, ff, FOUR≤ features also two nonclassical values: ⊥, representing incomplete information, and ⊤, representing inconsistency. The nonclassical values are incomparable, and together with the classical ones they form a diamond-shaped lattice L4 known from Belnap's logic, which underlies the semantics of FOUR≤. The set of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  1
    (2 other versions)A Deductive System for Boole’s ‘ The Mathematical Analysis of Logic’ and its Application to Hypothetical Deductions.G. A. Kyriazis - forthcoming - History and Philosophy of Logic:1-25.
    George Boole published his account on hypotheticals in his pamphlet The Mathematical Analysis of Logic in 1847. Hypothetical deductions were not as developed as categorical ones by Boole’s time. It was still common practice to reduce hypotheticals to categoricals. Boole innovated by proposing an algebraic method to derive (equations expressing) the conclusions of hypotheticals. He had developed a calculus of classes for categoricals in his first pamphlet chapters and seemingly intended extending it to hypotheticals. Nonetheless, propositions can be only (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality.Avi Sion - 1999 - Geneva, Switzerland: CreateSpace & Kindle; Lulu..
    The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  35
    Fregean logics.J. Czelakowski & D. Pigozzi - 2004 - Annals of Pure and Applied Logic 127 (1-3):17-76.
    According to Frege's principle the denotation of a sentence coincides with its truth-value. The principle is investigated within the context of abstract algebraic logic, and it is shown that taken together with the deduction theorem it characterizes intuitionistic logic in a certain strong sense.A 2nd-order matrix is an algebra together with an algebraic closed set system on its universe. A deductive system is a second-order matrix over the formula algebra of some fixed but arbitrary language. A second-order (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  31.  96
    Natural deduction rules for a logic of vagueness.J. A. Burgess & I. L. Humberstone - 1987 - Erkenntnis 27 (2):197-229.
    Extant semantic theories for languages containing vague expressions violate intuition by delivering the same verdict on two principles of classical propositional logic: the law of noncontradiction and the law of excluded middle. Supervaluational treatments render both valid; many-Valued treatments, Neither. The core of this paper presents a natural deduction system, Sound and complete with respect to a 'mixed' semantics which validates the law of noncontradiction but not the law of excluded middle.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  32. Expressive Power and Incompleteness of Propositional Logics.James W. Garson - 2010 - Journal of Philosophical Logic 39 (2):159-171.
    Natural deduction systems were motivated by the desire to define the meaning of each connective by specifying how it is introduced and eliminated from inference. In one sense, this attempt fails, for it is well known that propositional logic rules underdetermine the classical truth tables. Natural deduction rules are too weak to enforce the intended readings of the connectives; they allow non-standard models. Two reactions to this phenomenon appear in the literature. One is to try to restore the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  33. On graph-theoretic fibring of logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
    A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  34.  67
    Arithmetical interpretations and Kripke frames of predicate modal logic of provability.Taishi Kurahashi - 2013 - Review of Symbolic Logic 6 (1):1-18.
    Solovay proved the arithmetical completeness theorem for the system GL of propositional modal logic of provability. Montagna proved that this completeness does not hold for a natural extension QGL of GL to the predicate modal logic. Let Th(QGL) be the set of all theorems of QGL, Fr(QGL) be the set of all formulas valid in all transitive and conversely well-founded Kripke frames, and let PL(T) be the set of all predicate modal formulas provable in Tfor any arithmetical (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  30
    Reflexive Intermediate Propositional Logics.Nathan C. Carter - 2006 - Notre Dame Journal of Formal Logic 47 (1):39-62.
    Which intermediate propositional logics can prove their own completeness? I call a logic reflexive if a second-order metatheory of arithmetic created from the logic is sufficient to prove the completeness of the original logic. Given the collection of intermediate propositional logics, I prove that the reflexive logics are exactly those that are at least as strong as testability logic, that is, intuitionistic logic plus the scheme $\neg φ ∨ \neg\neg φ. I show that (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  36. Categorical Quantification.Constantin C. Brîncuş - 2024 - Bulletin of Symbolic Logic 30 (2):pp. 227-252.
    Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  56
    Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere.Torben Braüner - 2005 - Studia Logica 81 (2):191-226.
    A hybrid logic is obtained by adding to an ordinary modal logic further expressive power in the form of a second sort of propositional symbols called nominals and by adding so-called satisfaction operators. In this paper we consider hybridized versions of S5 (“the logic of everywhere”) and the modal logic of inequality (“the logic of elsewhere”). We give natural deduction systems for the logics and we prove functional completeness results.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  60
    Mathematik, Logik und Erfahrung. [REVIEW]H. H. - 1972 - Review of Metaphysics 25 (4):760-761.
    This book on mathematics, logic, and experience by the doyen of the Vienna Circle is an almost completely revised reprint of the volume originally published in 1957. The book is organized into four chapters, the first of which treats "mathematics and logic" and is one page in length. The other three chapters, "Logic and Experience," "Mathematics and Experience," and "Conventionalism and Its Refutation," share equally the remaining pages of the book. The validity of the principle of (...), Kraft argues, is the indispensable condition for order and knowledge. Consequently, logic cannot be an abstraction from the natural laws and cannot contain the formalized laws of reality. Rather logic has to be--and this is in accordance with Port-Royal and Wundt--a normative science. Kraft reminds us that only propositions which occur in predicate logic or class logic may have a truth value. Kraft therefore characterizes the principle of identity and the principle of contradiction as rules which are prelogical in nature, since they are the basis of order and serve as the norms of correct thinking. The validity of these prelogical rules rests on the fact that they constitute order and must consequently be accepted as necessary. The conception of logic as normative science puts the author in opposition to the view held by the Vienna Circle, namely, that the application of logic does not contain any problem. In Kraft's position, on the contrary, the necessity arises of showing the conditions under which logic is applicable. In respect of the applicability of logic, the nature of the reality serving as material in this application makes a difference; for the logical relation between the universal and the particular finds its fulfillment and its determination with regard to the content provided by reality. The condition which logic requires for its application is that the "manifold" be capable of being ordered and that it thereby make universality possible. In a similar way Kraft attempts to work out the conditions for the applicability of arithmetic and geometry, which like logic are independent of experience in respect to their validity. According to the author, arithmetic can be applied insofar as operative relations between numbers correspond to classes of sets. Geometry is applicable insofar as the coordination of certain empirical phenomena with geometrical elements and relations is possible. The applicability of geometry consequently presupposes the validity of certain natural laws, thereby denying the thesis of conventionalism that these can be arbitrarily chosen. Kraft argues convincingly in the third part of his book for his own thesis by showing the shortcomings of Dingler's procedure of exhaustion.--H. H. (shrink)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39. Knowledge of logical generality and the possibility of deductive reasoning.Corine Besson - 2019 - In Anders Nes & Timothy Hoo Wai Chan, Inference and Consciousness. London: Routledge. pp. 172-196.
    I address a type of circularity threat that arises for the view that we employ general basic logical principles in deductive reasoning. This type of threat has been used to argue that whatever knowing such principles is, it cannot be a fully cognitive or propositional state, otherwise deductive reasoning would not be possible. I look at two versions of the circularity threat and answer them in a way that both challenges the view that we need to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  40.  9
    Aggregating credences into beliefs: agenda conditions for impossibility results.Minkyung Wang & Chisu Kim - forthcoming - Social Choice and Welfare.
    Hybrid belief aggregation addresses aggregation of individual probabilistic beliefs into collective binary beliefs. In line with the development of judgment aggregation theory, our research delves into the identification of precise agenda conditions associated with some key impossibility theorems in the context of hybrid belief aggregation. We determine the necessary and sufficient level of logical interconnection between the propositions in an agenda for some key impossibilities to arise. Specifically, we prove three characterization theorems about hybrid belief aggregation: (i) Precisely the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  92
    Deductive completeness.Kosta Došen - 1996 - Bulletin of Symbolic Logic 2 (3):243-283.
    This is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The connections of the theorem with combinatory logic, and with modal and substructural logics, are briefly considered at the end.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  42.  20
    Paradox, Harmony, and Crisis in Phenomenology.Judson Webb - 2017 - In Stefania Centrone, Essays on Husserl’s Logic and Philosophy of Mathematics. Dordrecht, Netherland: Springer Verlag.
    Husserl’s first work formulated what proved to be an algorithmically complete arithmetic, lending mathematical clarity to Kronecker’s reduction of analysis to finite calculations with integers. Husserl’s critique of his nominalism led him to seek a philosophical justification of successful applications of symbolic arithmetic to nature, providing insight into the “wonderful affinity” between our mathematical thoughts and things without invoking a pre-established harmony. For this, Husserl develops a purely descriptive phenomenology for which he found inspiration in Mach’s proposal of a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  18
    On a second order propositional operator in intuitionistic logic.A. A. Troelstra - 1981 - Studia Logica 40:113.
    This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by * ≡ ∃Q. In full topological models * is not generally definable but over Cantor-space and the reals it can be classically shown that *↔ ⅂⅂P; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  44. Hilbert arithmetic as a Pythagorean arithmetic: arithmetic as transcendental.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (54):1-24.
    The paper considers a generalization of Peano arithmetic, Hilbert arithmetic as the basis of the world in a Pythagorean manner. Hilbert arithmetic unifies the foundations of mathematics (Peano arithmetic and set theory), foundations of physics (quantum mechanics and information), and philosophical transcendentalism (Husserl’s phenomenology) into a formal theory and mathematical structure literally following Husserl’s tracе of “philosophy as a rigorous science”. In the pathway to that objective, Hilbert arithmetic identifies by itself information related to finite sets and series and quantum (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45. Logically Equivalent False Universal Propositions with Different Counterexample Sets.John Corcoran - 2007 - Bulletin of Symbolic Logic 11:554-5.
    This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  37
    Completeness with respect to a chain and universal models in fuzzy logic.Franco Montagna - 2011 - Archive for Mathematical Logic 50 (1-2):161-183.
    In this paper we investigate fuzzy propositional and first order logics which are complete or strongly complete with respect to a single chain, and we relate this properties with the existence of a universal chain for the logic.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Theory of completeness for logical spaces.Kensaku Gomi - 2009 - Logica Universalis 3 (2):243-291.
    A logical space is a pair of a non-empty set A and a subset of . Since is identified with {0, 1} A and {0, 1} is a typical lattice, a pair of a non-empty set A and a subset of for a certain lattice is also called a -valued functional logical space. A deduction system on A is a pair (R, D) of a subset D of A and a relation R between A* and A. In terms (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Expanding the universe of universal logic.James Trafford - 2014 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 29 (3):325-343.
    In [5], Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract “core” of logics in general, where logical syntax and semantics are “two sides of the same coin”. The central suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  49.  60
    A predicate logical extension of a subintuitionistic propositional logic.Ernst Zimmermann - 2002 - Studia Logica 72 (3):401-410.
    We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke''s semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  9
    Logic as a tool: a guide to formal logical reasoning.Valentin Goranko - 2016 - Hoboken, NJ: Wiley.
    Understanding propositional logic -- Deductive reasoning in propositional logic -- Understanding first-order logic -- Deductive reasoning in first-order logic -- Applications : mathematical proofs and automated reasoning -- Answers and solutions to selected exercises.
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 966