Related categories
Subcategories:
4684 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 4684
Material to categorize
  1. Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko (2012). Logic for Physical Space: From Antiquity to Present Days. Synthese 186 (3):619 - 632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Mitrofan Nikolaevich[from old catalog] Alekseev (1959). Dialektika Form Myshlenii͡a.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  3. James Alf (1948). The Priest. Thought: A Journal of Philosophy 23 (3):565-566.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. Joseph Almog (1996). The What and the How II: Reals and Mights. Noûs 30 (4):413-433.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. José Alfredo Amor (2009). Strong Soundness-Completeness Theorem: A Semantic Approach. Teorema: International Journal of Philosophy 28 (3):173-190.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  6. José Alfredo Amor (2004). Un Refinamiento Del Concepto de Sistema Axiomático. Signos Filosóficos 6 (11):121-140.
    The aim of this paper is to propose a particular conception and formulation of the concepts of formal derivation and axiomatic system, which, although not orthodox, remain part of classical first order logic. It is proposed, in particular, that the definition of formal derivation includes the pos..
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. José Alfredo Amor (2003). A Structural Characterization of Extended Correctness-Completeness in Classical Logic (Una caracterización estructural de la correctud-completud extendida en la lógica clásica). Critica 35 (103):69 - 82.
    In this paper I deal with first order logic and axiomatic systems. I present the metalogical results that show the property of satisfying Modus Ponens as a necessary and sufficient condition for the extended completeness of the system, and to the Deduction Metatheorem as a necessary and sufficient condition for the extended correctness of the system. Both supposing that the system satisfies the corresponding restricted properties. These results show that the choice of that rule of inference and of that metatheorem, (...)
    Remove from this list |
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Beatrice Amrhein (1995). Aspects of Universal Algebra in Combinatory Logic. In Erwin Engeler (ed.), The Combinatory Programme. Birkhäuser 31--45.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  9. Maribel Anacona, Luis Carlos Arboleda & F. Javier Pérez-Fernández (2014). On Bourbaki's Axiomatic System for Set Theory. Synthese 191 (17):4069-4098.
    In this paper we study the axiomatic system proposed by Bourbaki for the Theory of Sets in the Éléments de Mathématique. We begin by examining the role played by the sign \(\uptau \) in the framework of its formal logical theory and then we show that the system of axioms for set theory is equivalent to Zermelo–Fraenkel system with the axiom of choice but without the axiom of foundation. Moreover, we study Grothendieck’s proposal of adding to Bourbaki’s system the axiom (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. D. A. Anapolitanos (1979). Automorphisms of Finite Order. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (33):565-575.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. D. A. Anapolitanos & J. Väänänen (1980). On the Axiomatizability of the Notion of an Automorphism of a Finite Order. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):433-437.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. Alan Ross Anderson (1972). An Intensional Interpretation of Truth-Values. Mind 81 (323):348-371.
    R-Dagger is the theory of relevant implication, Got from the calculus r (see belnap, Jsl, 32, 1-22), By adding machinery for propositional quantification. In r-Dagger define t as for some p, P, F as for all p, P. Then (t, F) is closed in r-Dagger under truth-Functions and relevant implication, Which, When confined to (t, F) acts just like material 'implication.' but r-Dagger admits of many propositions other than t, F. The article also contains polemics against extensionalism and nominalism. (edited).
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Alan Ross Anderson, Nuel D. Belnap & John R. Wallace (1960). Independent Axiom Schemata for the Pure Theory of Entailment. Mathematical Logic Quarterly 6 (1‐6):93-95.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  14. Curtis Anthony Anderson (1977). Some Models for the Logic of Sense and Denotation with an Application to Alternative. Dissertation, University of California, Los Angeles
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  15. Frederick Anderson (1931). Swabey's Logic and Nature. Journal of Philosophy 28:217.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  16. Michael L. Anderson, John Grant & Don Perlis, On the Reasoning of Real-World Agents: Toward a Semantics for Active Logic.
    The current paper details a restricted semantics for active logic, a time-sensitive, contradictiontolerant logical reasoning formalism. Central to active logic are special rules controlling the inheritance of beliefs in general, and beliefs about the current time in particular, very tight controls on what can be derived from direct contradictions (P &¬P ), and mechanisms allowing an agent to represent and reason about its own beliefs and past reasoning. Using these ideas, we introduce a new definition of model and of logical (...)
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  17. W. Anderson (1935). The Principles of Logic: An Introductory Survey. [REVIEW] Australasian Journal of Philosophy 13:142.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  18. Cantini Andrea (2002). Polytime, Combinatory Logic and Positive Safe Induction. Archive for Mathematical Logic 41 (2).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  19. Edvard Pavlovich Andreev, Institut Sotsiologicheskikh Issledovanii Sssr) & Sovetskaia Sotsiologicheskaia Assotsiatsiia (1977). Metody Sovremennoi Matematiki I Logiki V Sotsiologicheskikh Issledovaniiakh [Sbornik Statei]. In-T Sotsiol. Issledovanii.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  20. Hajnal Andreka, Peter Burmeister & Istvan Nemeti (1980). Quasi Equational Logic Of Partial Algebras. Bulletin of the Section of Logic 9 (4):193-197.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  21. Hajnal Andréka, Judit X. Madarász & István Németi (2005). Mutual Definability Does Not Imply Definitional Equivalence, a Simple Example. Mathematical Logic Quarterly 51 (6):591-597.
    We give two theories, Th1 and Th2, which are explicitly definable over each other , but are not definitionally equivalent. The languages of the two theories are disjoint.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  22. Hajnal Andreka & Istvan Nemeti (1978). Completeness of Floyd Logic. Bulletin of the Section of Logic 7 (3):115-119.
    This is an abstract of our paper \A characterisation of Floyd-provable programs" submitted to Theoretical Computer Science. ! denotes the set of natural numbers. Y =d fyi : i 2 !g is the set of variable symbols. L denotes the set of classical rst order formulas of type t possibly with free variables , where t is the similarity type of arithmetic, i.e. it consists of \+; ; 0; 1" with arities \2; 2; 0; 0".
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  23. Hajnal Andreka, Istvan Nemeti & Ildiko Sain (1979). Program Verification Within and Without Logic. Bulletin of the Section of Logic 8 (3):124-128.
    Theorem 1 states a negative result about the classical semantics j= ! of program schemes. Theorem 2 investigates the reason for this. We conclude that Theorem 2 justies the Henkin-type semantics j= for which the opposite of the present Theorem 1 was proved in [1]{[3] and also in a dierent form in part III of [5]. The strongest positive result on j= is Corollary 6 in [3].
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  24. Alessandro Andretta (ed.) (2007). On Applications of Transfer Principles in Model Theory. Quaderni di Matematica.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  25. Floy Andrews Doull (1996). The Principle of Excluded Middle Then and Now: Aristotle and Principia Mathematica. Animus 1:53-66.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Floy Andrews (1996). The Principle of Excluded Middle Then and Now: Aristotle and Principia Mathematica. Animus 1:53-66.
    The prevailing truth-functional logic of the twentieth century, it is argued, is incapable of expressing the subtlety and richness of Aristotle's Principle of Excluded Middle, and hence cannot but misinterpret it. Furthermore, the manner in which truth-functional logic expresses its own Principle of Excluded Middle is less than satisfactory in its application to mathematics. Finally, there are glimpses of the "realism" which is the metaphysics demanded by twentieth century logic, with the remarkable consequent that Classical logic is a particularly inept (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  27. James H. Andrews (1992). Logic Programming Operational Semantics and Proof Theory. Monograph Collection (Matt - Pseudo).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  28. P. B. Andrews & Mitsuru Yasuhara (2003). REVIEWS-An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Bulletin of Symbolic Logic 9 (3):408.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  29. Peter B. Andrews (1974). Provability in Elementary Type Theory. Mathematical Logic Quarterly 20 (25‐27):411-418.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. T. G. Andrews (1940). The Effect of Benzedrine Sulfate on Syllogistic Reasoning. Journal of Experimental Psychology 26 (4):423.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Uri Andrews (2011). New Spectra of Strongly Minimal Theories in Finite Languages. Annals of Pure and Applied Logic 162 (5):367-372.
    We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Mitsumasa Anno & Akihiro Nozaki (1985). Anno's Hat Tricks. Monograph Collection (Matt - Pseudo).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  33. Coelho Antonio (2011). Da costa on ontology: a naturalisticinterpretation. Manuscrito 34 (1).
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  34. Hiroshi Aoyama (1998). The Semantic Completeness of a Global Intuitionistic Logic. Mathematical Logic Quarterly 44 (2):167-175.
    In this paper we will study a formal system of intuitionistic modal predicate logic. The main result is its semantic completeness theorem with respect to algebraic structures. At the end of the paper we will also present a brief consideration of its syntactic relationships with some similar systems.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Leo Apostel (1982). The Future of Piagetian Logic. Revue Internationale de Philosophie 36 (4):567.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  36. K. R. Apt & W. Marek (1974). Second Order Arithmetic and Related Topics. Annals of Mathematical Logic 6 (3-4):177-229.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. Krzysztof R. Apt & Franco Turini (1995). Meta-Logics and Logic Programming. Monograph Collection (Matt - Pseudo).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  38. Arthur W. Apter (2005). An Easton Theorem for Level by Level Equivalence. Mathematical Logic Quarterly 51 (3):247-253.
    We establish an Easton theorem for the least supercompact cardinal that is consistent with the level by level equivalence between strong compactness and supercompactness. In both our ground model and the model witnessing the conclusions of our theorem, there are no restrictions on the structure of the class of supercompact cardinals. We also briefly indicate how our methods of proof yield an Easton theorem that is consistent with the level by level equivalence between strong compactness and supercompactness in a universe (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  39. Arthur W. Apter (2000). A New Proof of a Theorem of Magidor. Archive for Mathematical Logic 39 (3):209-211.
    We give a new proof using iterated Prikry forcing of Magidor's theorem that it is consistent to assume that the least strongly compact cardinal is the least supercompact cardinal.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  40. Arthur W. Apter & Mirna Džamonja (2001). Some Remarks on a Question of D. H. Fremlin Regarding Ε-Density. Archive for Mathematical Logic 40 (7):531-540.
    We show the relative consistency of ℵ1 satisfying a combinatorial property considered by David Fremlin (in the question DU from his list) in certain choiceless inner models. This is demonstrated by first proving the property is true for Ramsey cardinals. In contrast, we show that in ZFC, no cardinal of uncountable cofinality can satisfy a similar, stronger property. The questions considered by D. H. Fremlin are if families of finite subsets of ω1 satisfying a certain density condition necessarily contain all (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  41. P. D. Aquino (2001). Quotient Fields of a Model of IDelta~0 + Omega~1. Mathematical Logic Quarterly 47 (3):305-314.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  42. Lennart Aqvist (1991). Solution to Chisholm's Paradox. In Georg Schurz (ed.), Advances in Scientific Philosophy. 24--127.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  43. Lennart Åqvist (1965). A New Approach to the Logical Theory of Interrogatives. [Uppsala].
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  44. Regina Arag N. (1995). Some Boolean Algebras with Finitely Many Distinguished Ideals I. Mathematical Logic Quarterly 41 (4):485-504.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  45. R. Aragón (2003). Some Boolean Algebras with Finitely Many Distinguished Ideals II. Mathematical Logic Quarterly 49 (3):260.
    We describe the countably saturated models and prime models of the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal such that the supremum of the ideal exists. We prove that there are infinitely many completions of the theory of Boolean algebras (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Regina Aragón (1995). Some Boolean Algebras with Finitely Many Distinguished Ideals I. Mathematical Logic Quarterly 41 (4):485-504.
    We consider the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal where the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal where the supremum of the ideal exists. First, we find elementary invariants for Thprin and Thsa. If T is a theory in a first order language and α is a linear (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  47. Toshiyasu Arai (2011). Quick Cut-Elimination for Strictly Positive Cuts. Annals of Pure and Applied Logic 162 (10):807-815.
    In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  48. Toshiyasu Arai (2002). Epsilon Substitution Method for Theories of Jump Hierarchies. Archive for Mathematical Logic 41 (2):123-153.
    We formulate epsilon substitution method for theories (H)α0 of absolute jump hierarchies, and give two termination proofs of the H-process: The first proof is an adaption of Mints M, Mints-Tupailo-Buchholz MTB, i.e., based on a cut-elimination of a specially devised infinitary calculus. The second one is an adaption of Ackermann Ack. Each termination proof is based on transfinite induction up to an ordinal θ(α0+ ω)0, which is best possible.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  49. Toshiyasu Arai (2000). Ordinal Diagrams for Recursively Mahlo Universes. Archive for Mathematical Logic 39 (5):353-391.
    In this paper we introduce a recursive notation system $O(\mu)$ of ordinals. An element of the notation system is called an ordinal diagram following G. Takeuti [25]. The system is designed for proof theoretic study of theories of recursively Mahlo universes. We show that for each $\alpha<\Omega$ in $O(\mu)$ KPM proves that the initial segment of $O(\mu)$ determined by $\alpha$ is a well ordering. Proof theoretic study for such theories will be reported in [9].
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  50. Toshiyasu Arai (1998). Consistency Proof Via Pointwise Induction. Archive for Mathematical Logic 37 (3):149-165.
    We show that the consistency of the first order arithmetic $PA$ follows from the pointwise induction up to the Howard ordinal. Our proof differs from U. Schmerl [Sc]: We do not need Girard's Hierarchy Comparison Theorem. A modification on the ordinal assignment to proofs by Gentzen and Takeuti [T] is made so that one step reduction on proofs exactly corresponds to the stepping down $\alpha\mapsto\alpha [1]$ in ordinals. Also a generalization to theories $ID_q$ of finitely iterated inductive definitions is proved.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 4684