Switch to: References

Citations of:

Introduction to mathematical logic

Princeton, N.J.,: Van Nostrand (1964)

Add citations

You must login to add citations.
  1. Aftermath Of The Nothing.Laurent Dubois - 2017 - In J.-Y. Beziau, A. Costa-Leite & I. M. L. D’Ottaviano (eds.), CLE, v.81. pp. 93-124.
    This article consists in two parts that are complementary and autonomous at the same time. -/- In the first one, we develop some surprising consequences of the introduction of a new constant called Lambda in order to represent the object ``nothing" or ``void" into a standard set theory. On a conceptual level, it allows to see sets in a new light and to give a legitimacy to the empty set. On a technical level, it leads to a relative resolution of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Determinacy separations for class games.Sherwood Hachtman - 2019 - Archive for Mathematical Logic 58 (5-6):635-648.
    We show, assuming weak large cardinals, that in the context of games of length \ with moves coming from a proper class, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of L that exists under large cardinal assumptions weaker than an inaccessible. Our argument is sufficiently general to give a family of determinacy separation results applying in any setting where the universal class is sufficiently closed; e.g., in third, seventh, or (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Vidal's trivalent explanations for defective conditional in mathematics.Yaroslav Petrukhin & Vasily Shangin - 2019 - Journal of Applied Non-Classical Logics 29 (1):64-77.
    ABSTRACTThe paper deals with a problem posed by Mathieu Vidal to provide a formal representation for defective conditional in mathematics Vidal, M. [. The defective conditional in mathematics. Journal of Applied Non-Classical Logics, 24, 169–179]. The key feature of defective conditional is that its truth-value is indeterminate if its antecedent is false. In particular, we are interested in two explanations given by Vidal with the use of trivalent logics. By analysing a simple argument from plane geometry, where defective conditional is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Obligations, Sophisms and Insolubles.Stephen Read - 2013 - National Research University “Higher School of Economics” - (Series WP6 “Humanities”).
    The focus of the paper is a sophism based on the proposition ‘This is Socrates’ found in a short treatise on obligational casus attributed to William Heytesbury. First, the background to the puzzle in Walter Burley’s traditional account of obligations (the responsio antiqua), and the objections and revisions made by Richard Kilvington and Roger Swyneshed, are presented. All six types of obligations described by Burley are outlined, including sit verum, the type used in the sophism. Kilvington and Swyneshed disliked the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Quantification and Paradox.Edward Ferrier - 2018 - Dissertation, University of Massachusetts Amherst
    I argue that absolutism, the view that absolutely unrestricted quantification is possible, is to blame for both the paradoxes that arise in naive set theory and variants of these paradoxes that arise in plural logic and in semantics. The solution is restrictivism, the view that absolutely unrestricted quantification is not possible. -/- It is generally thought that absolutism is true and that restrictivism is not only false, but inexpressible. As a result, the paradoxes are blamed, not on illicit quantification, but (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)About Nothing.Dale Jacquette - 2013 - Humana Mente 6 (25).
    The possibilities are explored of considering nothing as the intended object of thoughts that are literally about the concept of nothing first, and thereby of nothing. Nothing, on the proposed analysis, turns out to be nothing other than the property of being an intendable object. There are propositions that look to be both true and to be about nothing in the sense of being about the concept and ultimate intended object of what is here formally defined and designated as N-nothing. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Neglect of Epistemic Considerations in Logic: The Case of Epistemic Assumptions.Göran Sundholm - 2019 - Topoi 38 (3):551-559.
    The two different layers of logical theory—epistemological and ontological—are considered and explained. Special attention is given to epistemic assumptions of the kind that a judgement is granted as known, and their role in validating rules of inference, namely to aid the inferential preservation of epistemic matters from premise judgements to conclusion judgement, while ordinary Natural Deduction assumptions serve to establish the holding of consequence from antecedent propositions to succedent proposition.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.
    Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Three Dogmas of First-Order Logic and some Evidence-based Consequences for Constructive Mathematics of differentiating between Hilbertian Theism, Brouwerian Atheism and Finitary Agnosticism.Bhupinder Singh Anand - manuscript
    We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.
    We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction and truth (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Logical Contingency of Identity.Hanoch Ben-Yami - 2018 - European Journal of Analytic Philosophy 14 (2):5-10.
    I show that intuitive and logical considerations do not justify introducing Leibniz’s Law of the Indiscernibility of Identicals in more than a limited form, as applying to atomic formulas. Once this is accepted, it follows that Leibniz’s Law generalises to all formulas of the first-order Predicate Calculus but not to modal formulas. Among other things, identity turns out to be logically contingent.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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 by \ is derivable in \. It is known that any (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (2 other versions)Objetos matemáticos sensibles y objetos Matemáticos inteligibles.Víctor Hugo Chica Pérez, Luis F. Echeverri & Edwin Zarrazola - 2016 - Estudios de Filosofía (Universidad de Antioquia) 54:187-205.
    Download  
     
    Export citation  
     
    Bookmark  
  • The Interpretation of Early Modern Philosophy.Paul Taborsky - 2018 - Newcastle upon Tyne: Cambridge Scholars Publishing.
    What is early modern philosophy? Two interpretative trends have predominated in the related literature. One, with roots in the work of Hegel and Heidegger, sees early modern thinking either as the outcome of a process of gradual rationalization (leading to the principle of sufficient reason, and to "ontology" as distinct from metaphysics), or as a reflection of an inherent subjectivity or representational semantics. The other sees it as reformulations of medieval versions of substance and cause, suggested by, or leading to, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Composition and Identities.Manuel Lechthaler - 2017 - Dissertation, University of Otago
    Composition as Identity is the view that an object is identical to its parts taken collectively. I elaborate and defend a theory based on this idea: composition is a kind of identity. Since this claim is best presented within a plural logic, I develop a formal system of plural logic. The principles of this system differ from the standard views on plural logic because one of my central claims is that identity is a relation which comes in a variety of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Problems in Epistemic Space.Jens Christian Bjerring - 2012 - Journal of Philosophical Logic 43 (1):153-170.
    When a proposition might be the case, for all an agent knows, we can say that the proposition is epistemically possible for the agent. In the standard possible worlds framework, we analyze modal claims using quantification over possible worlds. It is natural to expect that something similar can be done for modal claims involving epistemic possibility. The main aim of this paper is to investigate the prospects of constructing a space of worlds—epistemic space—that allows us to model what is epistemically (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On Rational Physics: a Basic Formalism for Relativistic Physics and "A Unique Mathematical Derivation of the Fundamental Laws of Nature Based on a New Algebraic Approach".Ramin Zahedi - 2015 - INSPIRE-HEP, High Energy Physics (HEP) Database, CERN Online Publications; Hyper Article En Ligne, CNRS, (Collect. 2017), Université Paris 1 Sorbonne, France.
    In Part I of this article, I provide a general overview of a number of current discontinuous approaches to fundamental physics. In Part II (the main part, Ref. [37]), as a new mathematical approach to origin of the laws of nature, using a new basic algebraic axiomatic (matrix) formalism based on the ring theory and Clifford algebras (presented in Sec.2), "it is shown that certain mathematical forms of fundamental laws of nature, including laws governing the fundamental forces of nature (represented (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Reference to Abstract Objects in Discourse.Nicholas Asher - 1993 - Dordrecht, Boston, and London: Kluwer.
    This volume is about abstract objects and the ways we refer to them in natural language. Asher develops a semantical and metaphysical analysis of these entities in two stages. The first reflects the rich ontology of abstract objects necessitated by the forms of language in which we think and speak. A second level of analysis maps the ontology of natural language metaphysics onto a sparser domain--a more systematic realm of abstract objects that are fully analyzed. This second level reflects the (...)
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Filter Constructions in Boolean Valued Model Theory.Alan M. Shorb - 1972 - Mathematical Logic Quarterly 18 (13-15):193-200.
    Download  
     
    Export citation  
     
    Bookmark  
  • Temas em filosofia contemporânea II.Becker Arenhart Jonas Rafael, Conte Jaimir & Mortari Cezar Augusto - 2016 - Florianópolis, SC, Brasil: NEL/UFSC - Universidade Federal de Santa Catarina.
    Sumário: 1. El caso del método científico, Alberto Oliva; 2. Un capítulo de la prehistoria de las ciencias humanas: la defensa por Vico de la tópica, Jorge Alberto Molina; 3. La figura de lo cognoscible y los mundos, Pablo Vélez León; 4. Lebenswelt de Husserl y las neurociencias, Vanessa Fontana; 5. El uso estético del concepto de mundos posibles, Jairo Dias Carvalho; 6. Realismo normativo no naturalista y mundos morales imposibles, Alcino Eduardo Bonella; 7. En la lógica de pragmatismo, Hércules (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • König's Infinity Lemma and Beth's Tree Theorem.George Weaver - 2017 - History and Philosophy of Logic 38 (1):48-56.
    König, D. [1926. ‘Sur les correspondances multivoques des ensembles’, Fundamenta Mathematica, 8, 114–34] includes a result subsequently called König's Infinity Lemma. Konig, D. [1927. ‘Über eine Schlussweise aus dem Endlichen ins Unendliche’, Acta Litterarum ac Scientiarum, Szeged, 3, 121–30] includes a graph theoretic formulation: an infinite, locally finite and connected graph includes an infinite path. Contemporary applications of the infinity lemma in logic frequently refer to a consequence of the infinity lemma: an infinite, locally finite tree with a root has (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Methodology for Teaching Logic-Based Skills to Mathematics Students.Arnold Cusmariu - 2016 - Symposion: Theoretical and Applied Inquiries in Philosophy and Social Sciences 3 (3):259-292.
    Mathematics textbooks teach logical reasoning by example, a practice started by Euclid; while logic textbooks treat logic as a subject in its own right without practical application to mathematics. Stuck in the middle are students seeking mathematical proficiency and educators seeking to provide it. To assist them, the article explains in practical detail how to teach logic-based skills such as: making mathematical reasoning fully explicit; moving from step to step in a mathematical proof in logically correct ways; and checking to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Theological Underpinnings of the Modern Philosophy of Mathematics.Vladislav Shaposhnikov - 2016 - Studies in Logic, Grammar and Rhetoric 44 (1):147-168.
    The study is focused on the relation between theology and mathematics in the situation of increasing secularization. My main concern in the second part of this paper is the early-twentieth-century foundational crisis of mathematics. The hypothesis that pure mathematics partially fulfilled the functions of theology at that time is tested on the views of the leading figures of the three main foundationalist programs: Russell, Hilbert and Brouwer.
    Download  
     
    Export citation  
     
    Bookmark  
  • Same Same But Different: An Alphabetically Innocent Compositional Predicate Logic.Udo Klein & Wolfgang Sternefeld - 2017 - Journal of Philosophical Logic 46 (1):65-95.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Variable Binding Term Operators.John Corcoran, William Hatcher & John Herring - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (12):177-182.
    Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Dominof-Sets.David W. Straight - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):235-249.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Algebraic Semantics for Modal Predicate Logic.James B. Freeman - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):523-552.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • O comprometimento da identidade com a individuação nas teorias formais clássicas.Jaison Schinaider - 2015 - Filosofia Unisinos 16 (1).
    Download  
     
    Export citation  
     
    Bookmark  
  • Inter-model connectives and substructural logics.Igor Sedlár - 2014 - In Roberto Ciuni, Heinrich Wansing & Caroline Willkommen (eds.), Recent Trends in Philosophical Logic (Proceedings of Trends in Logic XI). Cham, Switzerland: Springer. pp. 195-209.
    The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Pure Logic with Branched Quantifiers.Marcin Mostowski - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):45-48.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Weak Conditional Comparative Probability as a Formal Semantic Theory.Charles G. Morgan - 1984 - Mathematical Logic Quarterly 30 (13-16):199-212.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Meta‐Argumentation as An Argumentation Metatheory.Hasmik Hovhannisyan - 2015 - Metaphilosophy 46 (3):479-487.
    This article shows that the Rhodian model of metatheory can be successfully applied to nonformal systems of a methodological rather than an axiological nature if the demands of the model are satisfied. This requires that we take into account the possible variations of Rhodian models of argumentation and choose the most effective of them. Plato's model of meta-argumentation is only applicable to fields of argumentation that are completely formalized and could be presented as whole general theories.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)On Discrete Physics: a Perfect Deterministic Structure for Reality – and "A Direct Logical Derivation of the Fundamental Laws of Nature".Ramin [A.] Zahedi - 2015 - CERN Document, Geneva, Switzerland, Record:1980381, PP. 11-99; Paris-Sorbonne University Publs., CCSD/CNRS-Record:01547739, PP. 11-99.
    Why do the fundamental forces of nature (i.e., the forces that appear to cause all the movements and interactions in the universe) manifest in the way, shape, and form that they do? This is one of the greatest ontological questions that science can investigate. In this article, we are going to consider this crucial question (and relevant issues) via a new axiomatic mathematical formalism. -/- In Part I (pp. 1-10) of this article we provide a general overview (and analysis) of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Intelligent Alarm Correlation and Abductive Reasoning.Stefania Bandini, Alessandro Mosca & Matteo Palmonari - 2006 - Logic Journal of the IGPL 14 (2):347-362.
    The main aim of this paper is to present a way to improve the e.ciency of an intelligent alarm correlation module by means of an abductive reasoner. The alarm correlation module is integrated in a more complex system that performs monitoring and control tasks over a tract of a highway. On the basis of a specific theory on the domain, explanations of anomalous traffic patterns can be provided taking into account those situations not directly detected by data acquisition technology. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Review of Ernest Davis: Representations of Commonsense Knowledge. [REVIEW]Barry Smith - 1994 - Minds and Machines 4 (2):245-249.
    Review of a compendium of alternative formal representations of common-sense knowledge. The book is centered largely on formal representations drawn from first-order logic, and thus lies in the tradition of Kenneth Forbus, Patrick Hayes and Jerry Hobbs.
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)What is a Contradiction?Patrick Grim - 2004 - In Graham Priest, Jc Beall & Bradley P. Armour-Garb (eds.), The law of non-contradiction : new philosophical essays. New York: Oxford University Press. pp. 49--72.
    The Law of Non-Contradiction holds that both sides of a contradiction cannot be true. Dialetheism is the view that there are contradictions both sides of which are true. Crucial to the dispute, then, is the central notion of contradiction. My first step here is to work toward clarification of that simple and central notion: Just what is a contradiction?
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Plausible reasoning: a first-order approach.Silvana Badaloni & Alberto Zanardo - 1996 - Journal of Applied Non-Classical Logics 6 (3):215-261.
    Download  
     
    Export citation  
     
    Bookmark  
  • Brief study of G'3 logic.Mauricio Osorio Galindo & José Luis Carballido Carranza - 2008 - Journal of Applied Non-Classical Logics 18 (4):475-499.
    We present a Hilbert-style axiomatization of a recently introduced logic, called G'3 G'3 is based on a 3-valued semantics. We prove a soundness and completeness theorem. The replacement theorem holds in G'3. As it has already been shown in previous work, G'3 can express some non-monotonic semantics. We prove that G'3can define the same class of functions as Lukasiewicz 3 valued logic. Moreover, we identify some normal forms for this logic.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Lógica positiva : plenitude, potencialidade e problemas (do pensar sem negação).Tomás Barrero - 2004 - Dissertation, Universidade Estadual de Campinas
    This work studies some problems connected to the role of negation in logic, treating the positive fragments of propositional calculus in order to deal with two main questions: the proof of the completeness theorems in systems lacking negation, and the puzzle raised by positive paradoxes like the well-known argument of Haskel Curry. We study the constructive com- pleteness method proposed by Leon Henkin for classical fragments endowed with implication, and advance some reasons explaining what makes difficult to extend this constructive (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Odkud se berou axiomy logiky?Jaroslav Peregrin - 2013 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 20 (2):117-139.
    Download  
     
    Export citation  
     
    Bookmark  
  • Decision theory with prospect interference and entanglement.V. I. Yukalov & D. Sornette - 2011 - Theory and Decision 70 (3):283-328.
    We present a novel variant of decision making based on the mathematical theory of separable Hilbert spaces. This mathematical structure captures the effect of superposition of composite prospects, including many incorporated intentions, which allows us to describe a variety of interesting fallacies and anomalies that have been reported to particularize the decision making of real human beings. The theory characterizes entangled decision making, non-commutativity of subsequent decisions, and intention interference. We demonstrate how the violation of the Savage’s sure-thing principle, known (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Variants of Rescher's semantics for preference logic and some completeness theorems.Dirk van Dalen - 1974 - Studia Logica 33 (2):163-181.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Translations of Logical Formulas and the Equiconsistency Problem.Andrei A. Kuzichev - 1994 - Mathematical Logic Quarterly 40 (1):44-50.
    A translation of formulas in a language L1 to formulas in a language L2 is a mapping which preserves the parameters and commutes with the substitution prefix, the propositional connectives and the quantifiers. Every translation generates a corresponding transformation of theories in L1 to theories in L2. We formulate the equiconsistency problem for such transformations and propose a variant of its solution. First, for a transformation F we find the least theory A in L1 such that its inclusion in a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)A Theory of Ambiguous Types and Its Axiomatizations.Andrey A. Kuzichev - 1989 - Mathematical Logic Quarterly 35 (6):495-514.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Pure Logic with Branched Quantifiers.Marcin Mostowski - 1989 - Mathematical Logic Quarterly 35 (1):45-48.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Iterative Systems and Diagram Algorithms.Branislav Martić - 1981 - Mathematical Logic Quarterly 27 (36):561-564.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders.John Case - 1976 - Mathematical Logic Quarterly 22 (1):1-18.
    Download  
     
    Export citation  
     
    Bookmark