119 found
Order:
  1.  17
    Francis Jeffry Pelletier & Alasdair Urquhart (2003). Synonymous Logics. Journal of Philosophical Logic 32 (3):259-285.
    This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  2.  19
    Alasdair Urquhart (1972). Semantics for Relevant Logics. Journal of Symbolic Logic 37 (1):159-169.
  3.  4
    Stephen Cook & Alasdair Urquhart (1993). Functional Interpretations of Feasibly Constructive Arithmetic. Annals of Pure and Applied Logic 63 (2):103-200.
    A notion of feasible function of finite type based on the typed lambda calculus is introduced which generalizes the familiar type 1 polynomial-time functions. An intuitionistic theory IPVω is presented for reasoning about these functions. Interpretations for IPVω are developed both in the style of Kreisel's modified realizability and Gödel's Dialectica interpretation. Applications include alternative proofs for Buss's results concerning the classical first-order system S12 and its intuitionistic counterpart IS12 as well as proofs of some of Buss's conjectures concerning IS12, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  4.  12
    Alasdair Urquhart (1984). The Undecidability of Entailment and Relevant Implication. Journal of Symbolic Logic 49 (4):1059-1073.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   14 citations  
  5.  16
    Alasdair Urquhart (1979). Distributive Lattices with a Dual Homomorphic Operation. Studia Logica 38 (2):201 - 209.
    The lattices of the title generalize the concept of a De Morgan lattice. A representation in terms of ordered topological spaces is described. This topological duality is applied to describe homomorphisms, congruences, and subdirectly irreducible and free lattices in the category. In addition, certain equational subclasses are described in detail.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  6.  12
    Alasdair Urquhart (1987). Handbook of Philosophical Logic. Canadian Journal of Philosophy 17 (2):483-489.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  7.  59
    Alasdair Urquhart (2010). Anderson and Belnap's Invitation to Sin. Journal of Philosophical Logic 39 (4):453 - 472.
    Quine has argued that modal logic began with the sin of confusing use and mention. Anderson and Belnap, on the other hand, have offered us a way out through a strategy of nominahzation. This paper reviews the history of Lewis's early work in modal logic, and then proves some results about the system in which "A is necessary" is intepreted as "A is a classical tautology.".
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8.  62
    Alasdair Urquhart (1995). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 1 (4):425-467.
    Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  9.  18
    Alasdair Urquhart (1996). Duality for Algebras of Relevant Logics. Studia Logica 56 (1-2):263 - 276.
    This paper defines a category of bounded distributive lattice-ordered grupoids with a left-residual operation that corresponds to a weak system in the family of relevant logics. Algebras corresponding to stronger systems are obtained by adding further postulates. A duality theoey piggy-backed on the Priestley duality theory for distributive lattices is developed for these algebras. The duality theory is then applied in providing characterizations of the dual spaces corresponding to stronger relevant logics.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  10. Alasdair Urquhart (1986). Many-Valued Logic. In D. Gabbay & F. Guenther (eds.), Handbook of Philosophical Logic, Vol. Iii. D. Reidel Publishing Co.
    Translate
     
     
    Export citation  
     
    My bibliography   8 citations  
  11. Alasdair Urquhart (1999). Beth's Definability Theorem in Relevant Logics. In E. Orłowska (ed.), Logic at Work. Heidelberg 229--234.
     
    Export citation  
     
    My bibliography  
  12.  18
    Alasdair Urquhart (2015). Mathematical Depth. Philosophia Mathematica 23 (2):233-241.
    The first part of the paper is devoted to surveying the remarks that philosophers and mathematicians such as Maddy, Hardy, Gowers, and Zeilberger have made about mathematical depth. The second part is devoted to the question of whether we can make the notion precise by a more formal proof-theoretical approach. The idea of measuring depth by the depth and bushiness of the proof is considered, and compared to the related notion of the depth of a chess combination.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  13.  11
    Alasdair Urquhart (1993). Failure of Interpolation in Relevant Logics. Journal of Philosophical Logic 22 (5):449 - 479.
    Craig's interpolation theorem fails for the propositional logics E of entailment, R of relevant implication and T of ticket entailment, as well as in a large class of related logics. This result is proved by a geometrical construction, using the fact that a non-Arguesian projective plane cannot be imbedded in a three-dimensional projective space. The same construction shows failure of the amalgamation property in many varieties of distributive lattice-ordered monoids.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  14.  11
    Alasdair Urquhart (1978). Meaning and Modality. [REVIEW] Journal of Philosophy 75 (8):438-446.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  15. Alasdair Urquhart (2008). The Boundary Between Mathematics and Physics. In Paolo Mancosu (ed.), The Philosophy of Mathematical Practice. OUP Oxford 407--416.
     
    Export citation  
     
    My bibliography  
  16.  4
    Alasdair Urquhart (1973). An Interpretation of Many-Valued Logic. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 19 (7):111-114.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  17.  21
    Alasdair Urquhart (1987). Beyond Analytic Philosophy. Canadian Journal of Philosophy 17 (2):477-482.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  18.  10
    Alasdair Urquhart (2015). Pavel Pudlák. Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction. Springer Monographs in Mathematics. Springer, 2013. ISBN: 978-3-319-00118-0 ; 978-3-319-00119-7 . Pp. Xiv + 695. [REVIEW] Philosophia Mathematica 23 (3):435-438.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  19.  14
    Alasdair Urquhart (1999). The Complexity of Decision Procedures in Relevance Logic II. Journal of Symbolic Logic 64 (4):1774-1802.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  20.  10
    Alasdair Urquhart (1995). Reputation Among Logicians as Being Essentially Trivial. I Hope to Convince the Reader That It Presents Some of the Most Challenging and Intriguing Problems in Modern Logic. Although the Problem of the Complexity of Propositional Proofs is Very Natural, It has Been Investigated Systematically Only Since the Late 1960s. [REVIEW] Bulletin of Symbolic Logic 1 (4).
    Direct download  
     
    Export citation  
     
    My bibliography  
  21. Alasdair Urquhart (2003). The Theory of Types. In Nicholas Griffin (ed.), The Cambridge Companion to Bertrand Russell. Cambridge University Press 286--309.
    No categories
     
    Export citation  
     
    My bibliography   1 citation  
  22.  5
    Michael Soltys & Alasdair Urquhart (2004). Matrix Identities and the Pigeonhole Principle. Archive for Mathematical Logic 43 (3):351-357.
    We show that short bounded-depth Frege proofs of matrix identities, such as PQ=I⊃QP=I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonhole principle. Since the latter principle is known to require exponential-size bounded-depth Frege proofs, it follows that the propositional version of the matrix principle also requires bounded-depth Frege proofs of exponential size.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  23. Alasdair Urquhart (1983). Relevant Implication and Projective Geometry. Logique Et Analyse 26 (3):345-357.
     
    Export citation  
     
    My bibliography   4 citations  
  24. Alasdair Urquhart (2007). Four Variables Suffice. Australasian Journal of Philosophy 5:66-73.
    What I wish to propose in the present paper is a new form of “career induction” for ambitious young logicians. The basic problem is this: if we look at the n-variable fragments of relevant propositional logics, at what point does undecidability begin? Focus, to be definite, on the logic R. John Slaney showed that the 0-variable fragment of R contains exactly 3088 non-equivalent propositions, and so is clearly decidable. In the opposite direction, I claimed in my paper of 1984 that (...)
     
    Export citation  
     
    My bibliography   1 citation  
  25.  8
    Alasdair Urquhart (1995). X1. Introduction. The Classical Propositional Calculus has an Undeserved Reputation Among Logicians as Being Essentially Trivial. I Hope to Convince the Reader That It Presents Some of the Most Challenging and Intriguing Problems in Modern Logic. Although the Problem of the Complexity of Propositional Proofs is Very. [REVIEW] Bulletin of Symbolic Logic 1 (4).
    Direct download  
     
    Export citation  
     
    My bibliography  
  26.  29
    Alasdair Urquhart (2011). Henry M. Sheffer and Notational Relativity. History and Philosophy of Logic 33 (1):33 - 47.
    Henry M. Sheffer is well known to logicians for the discovery (or rather, the rediscovery) of the ?Sheffer stroke? of propositional logic. But what else did Sheffer contribute to logic? He published very little, though he is known to have been carrying on a rather mysterious research program in logic; the only substantial result of this research was the unpublished monograph The General Theory of Notational Relativity. The main aim of this paper is to explain, as far as possible (given (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  27.  24
    Alasdair Urquhart (2008). The Unnameable. Canadian Journal of Philosophy 38 (S1):119-135.
    Hans Herzberger as a philosopher and logician has shown deep interest both in the philosophy of Gottlob Frege, and in the topic of the inexpressible and the ineffable. In the fall of 1982, he taught at the University of Toronto, together with André Gombay, a course on Frege's metaphysics, philosophy of language, and foundations of arithmetic. Again, in the fall of 1986, he taught a seminar on the philosophy of language that dealt with 'the limits of discursive symbolism in several (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  28. Alasdair Urquhart & Albert C. Lewis (eds.) (1994). The Collected Papers of Bertrand Russell, Volume 4: Foundations of Logic, 1903-05. Routledge.
    First published in 1994. Routledge is an imprint of Taylor & Francis, an informa company.
     
    Export citation  
     
    My bibliography   1 citation  
  29.  12
    Alasdair I. F. Urquhart (1971). Completeness of Weak Implication. Theoria 37 (3):274-282.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  30.  22
    Alasdair Urquhart (2011). The Depth of Resolution Proofs. Studia Logica 99 (1-3):349-364.
    This paper investigates the depth of resolution proofs, that is to say, the length of the longest path in the proof from an input clause to the conclusion. An abstract characterization of the measure is given, as well as a discussion of its relation to other measures of space complexity for resolution proofs.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  31.  31
    Alasdair Urquhart & Albert Visser (2010). Decorated Linear Order Types and the Theory of Concatenation. In F. Delon (ed.), Logic Colloquium 2007. Cambridge University Press 1.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  32.  24
    Alasdair Urquhart (2010). Von Neumann, Gödel and Complexity Theory. Bulletin of Symbolic Logic 16 (4):516-530.
    Around 1989, a striking letter written in March 1956 from Kurt Gödel to John von Neumann came to light. It poses some problems about the complexity of algorithms; in particular, it asks a question that can be seen as the first formulation of the P=?NP question. This paper discusses some of the background to this letter, including von Neumann's own ideas on complexity theory. Von Neumann had already raised explicit questions about the complexity of Tarski's decision procedure for elementary algebra (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33.  16
    Alasdair Urquhart (1981). Distributive Lattices with a Dual Homomorphic Operation. II. Studia Logica 40 (4):391 - 404.
    An Ockham lattice is defined to be a distributive lattice with 0 and 1 which is equipped with a dual homomorphic operation. In this paper we prove: (1) The lattice of all equational classes of Ockham lattices is isomorphic to a lattice of easily described first-order theories and is uncountable, (2) every such equational class is generated by its finite members. In the proof of (2) a characterization of orderings of with respect to which the successor function is decreasing is (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  34. Alasdair Urquhart (1982). Intensional Languages Via Nominalization. Pacific Philosophical Quarterly 63 (2):186.
    No categories
     
    Export citation  
     
    My bibliography   2 citations  
  35.  1
    Alasdair Urquhart (1973). An Interpretation of Many‐Valued Logic. Mathematical Logic Quarterly 19 (7):111-114.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  36.  16
    Alasdair Urquhart (1973). A Semantical Theory of Analytic Implication. Journal of Philosophical Logic 2 (2):212 - 219.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  37.  4
    Alasdair Urquhart (1974). Implicational Formulas in Intuitionistic Logic. Journal of Symbolic Logic 39 (4):661-664.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  38.  4
    Alasdair Urquhart (2009). Emil Post. In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier 5--617.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39.  2
    Carlos Giannoni, Robert Meyer, J. Michael Dunn, Peter Woodruff, James Garson, Kent Wilson, Dorothy Grover, Ruth Manor, Alasdair Urquhart & Garrel Pottinger (1990). Nuel Belnap: Doctoral Students. In J. Dunn & A. Gupta (eds.), Truth or Consequences. Kluwer
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  40.  7
    Luc Lismont, Philippe Mongin, Strong Completeness, Volker Halbach, Hannes Leitgeb, Philip Welch, Francis Jeffry Pelletier, Alasdair Urquhart & Synonymous Logics (2003). Philip G. Calabrese/Operating on Functions with Variable Domains 1–18 Stewart Shapiro/Mechanism, Truth, and Penrose's New Argu-Ment 19–42 Steven E. Boër/Thought-Contents and the Formal Ontology Of. [REVIEW] Journal of Philosophical Logic 32:667-668.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  41. Alasdair Urquhart & Jagdish Mehra (1997). The Beat of a Different Drum: The Life and Science of Richard Feynman. International Studies in the Philosophy of Science 11 (3).
  42.  6
    Steve Giambrone & Alasdaire Urquhart (1987). Proof Theories for Semilattice Logics. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (5):433-439.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  43.  21
    Francis Jeffry Pelletier & Alasdair Urquhart (2008). Synonymous Logics: A Correction. [REVIEW] Journal of Philosophical Logic 37 (1):95 - 100.
    In an earlier paper entitled Synonymous Logics, the authors attempted to show that there are two modal logics so that each is exactly translatable into the other, but they are not translationally equivalent. Unfortunately, there is an error in the proof of this result. The present paper provides a new example of two such logics, and a proof of the result claimed in the earlier paper.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  44.  14
    Noriko H. Arai, Toniann Pitassi & Alasdair Urquhart (2006). The Complexity of Analytic Tableaux. Journal of Symbolic Logic 71 (3):777 - 790.
    The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45.  16
    Alasdair Urquhart (1981). Decidability and the Finite Model Property. Journal of Philosophical Logic 10 (3):367 - 370.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  46.  18
    Aldo Antonelli, Alasdair Urquhart & Richard Zach (2008). Mathematical Methods in Philosophy Editors' Introduction. Review of Symbolic Logic 1 (2):143-145.
    Mathematics and philosophy have historically enjoyed a mutually beneficial and productive relationship, as a brief review of the work of mathematician–philosophers such as Descartes, Leibniz, Bolzano, Dedekind, Frege, Brouwer, Hilbert, Gödel, and Weyl easily confirms. In the last century, it was especially mathematical logic and research in the foundations of mathematics which, to a significant extent, have been driven by philosophical motivations and carried out by technically minded philosophers. Mathematical logic continues to play an important role in contemporary philosophy, and (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  47.  16
    Janusz Czelakowski, Alasdair Urquhart, Ryszard Wójcicki, Jan Woleński, Andrzej Sendlewski & Marcin Mostowski (1990). Books Received. [REVIEW] Studia Logica 49 (1):151-161.
  48.  16
    Steve Giambrone, Robert K. Meyer & Alasdair Urquhart (1987). A Contractionless Semilattice Semantics. Journal of Symbolic Logic 52 (2):526-529.
  49.  12
    Alasdair Urquhart (1999). From Berkeley to Bourbaki. Dialogue 38 (03):587-.
    This has been a great century for logic and the foundations of mathematics. Ewald's excellent sourcebook is a welcome addition to the literature on the exciting developments of this and the past two centuries. The richness of the material on which Ewald is drawing is shown by the fact that he has assembled a broad and representative selection without once duplicating anything to be found in the famous sourcebooks of van Heijenoort and Benacerraf/Putnam.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  50.  3
    Alasdair Urquhart (1977). Review: Raymond Balbes, Philip Dwinger, Distributive Lattices. [REVIEW] Journal of Symbolic Logic 42 (4):587-588.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 119