151 found
Order:
  1.  28
    Synonymous Logics.Francis Jeffry Pelletier & Alasdair Urquhart - 2003 - 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 (8 more)  
     
    Export citation  
     
    My bibliography   16 citations  
  2.  6
    Functional Interpretations of Feasibly Constructive Arithmetic.Stephen Cook & Alasdair Urquhart - 1993 - 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   20 citations  
  3.  28
    Semantics for Relevant Logics.Alasdair Urquhart - 1972 - Journal of Symbolic Logic 37 (1):159-169.
  4.  15
    The Undecidability of Entailment and Relevant Implication.Alasdair Urquhart - 1984 - Journal of Symbolic Logic 49 (4):1059-1073.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   16 citations  
  5.  82
    Supervaluation Fixed-Point Logics of Truth.Philip Kremer & Alasdair Urquhart - 2008 - Journal of Philosophical Logic 37 (5):407-440.
    Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question open for the supervaluation fixed-point logic of truth and its variants. We show that the principal supervaluation fixed point logic of truth, when thought of as consequence relation, is highly complex: it is not even analytic. We also (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  6.  25
    Distributive Lattices with a Dual Homomorphic Operation.Alasdair Urquhart - 1979 - 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   15 citations  
  7. Relevance Logic: Problems Open and Closed.Alasdair Urquhart - 2016 - Australasian Journal of Logic 13 (1).
    I discuss a collection of problems in relevance logic. The main problems discussed are: the decidability of the positive semilattice system, decidability of the fragments of R in a restricted number of variables, and the complexity of the decision problem for the implicational fragment of R. Some related problems are discussed along the way.
     
    Export citation  
     
    My bibliography  
  8. Many-Valued Logic.Alasdair Urquhart - 1986 - In D. Gabbay & F. Guenther (eds.), Handbook of Philosophical Logic, Vol. Iii. D. Reidel Publishing Co..
    Translate
     
     
    Export citation  
     
    My bibliography   8 citations  
  9.  13
    Russell and Gödel.Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (4):504-520.
    Direct download  
     
    Export citation  
     
    My bibliography  
  10.  20
    Duality for Algebras of Relevant Logics.Alasdair Urquhart - 1996 - 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   6 citations  
  11.  12
    Failure of Interpolation in Relevant Logics.Alasdair Urquhart - 1993 - 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   7 citations  
  12.  16
    Handbook of Philosophical Logic.Alasdair Urquhart - 1987 - Canadian Journal of Philosophy 17 (2):483-489.
  13. The Boundary Between Mathematics and Physics.Alasdair Urquhart - 2008 - In Paolo Mancosu (ed.), The Philosophy of Mathematical Practice. Oxford University Press. pp. 407--416.
     
    Export citation  
     
    My bibliography  
  14.  3
    Temporal Logic.Nicholas Rescher & Alasdair Urquhart - 1972 - Philosophical Quarterly 22 (89):370-371.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography   10 citations  
  15. Beth's Definability Theorem in Relevant Logics.Alasdair Urquhart - 1999 - In E. Orłowska (ed.), Logic at Work. Heidelberg. pp. 229--234.
  16.  65
    The Complexity of Propositional Proofs.Alasdair Urquhart - 1995 - 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  
  17.  67
    Anderson and Belnap's Invitation to Sin.Alasdair Urquhart - 2010 - 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 (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  18. The Complexity of Propositional Proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  19.  8
    S. Barry Cooper and Andrew Hodges , The Once and Future Turing: Computing the World. Cambridge University Press, 2016. Xviii + 379 Pp.— Therein:Martin Davis. Algorithms, Equations, and Logic. Pp. 4–19.J.M.E. Hyland. The Forgotten Turing. Pp. 20–33.Andrew R. Booker. Turing and the Primes. Pp. 34–52.Ueli Maurer. Cryptography and Computation After Turing. Pp. 53–77.Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. Pp. 78–89.Stephen Wolfram. What Alan Turing Might Have Discovered. Pp. 92–105.Christof Teuscher. Designed Versus Intrinsic Computation. Pp. 106–116.Solomon Feferman. Turing’s ‘Oracle’: From Absolute to Relative Computability and Back. Pp. 300–334.P.D. Welch. Turing Transcendent: Beyond the Event Horizon. Pp. 335–360.Roger Penrose. On Attempting to Model the Mathematical Mind. Pp. 361–378. [REVIEW]Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (3):354-356.
    Direct download  
     
    Export citation  
     
    My bibliography  
  20.  17
    An Interpretation of Many-Valued Logic.Alasdair Urquhart - 1973 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 19 (7):111-114.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  21. Temporal Logic.Nicholas Rescher & Alasdair Urquhart - 1975 - Philosophy of Science 42 (1):100-103.
     
    Export citation  
     
    My bibliography   7 citations  
  22. The Beat of a Different Drum: The Life and Science of Richard Feynman.Alasdair Urquhart & Jagdish Mehra - 1997 - International Studies in the Philosophy of Science 11 (3).
  23. Intensional Languages Via Nominalization.Alasdair Urquhart - 1982 - Pacific Philosophical Quarterly 63 (2):186.
     
    Export citation  
     
    My bibliography   2 citations  
  24.  4
    An Interpretation of Many‐Valued Logic.Alasdair Urquhart - 1973 - Mathematical Logic Quarterly 19 (7):111-114.
  25.  15
    The Complexity of Decision Procedures in Relevance Logic II.Alasdair Urquhart - 1999 - Journal of Symbolic Logic 64 (4):1774-1802.
  26.  21
    Proof Theories for Semilattice Logics.Steve Giambrone & Alasdaire Urquhart - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (5):433-439.
  27. Relevant Implication and Projective Geometry.Alasdair Urquhart - 1983 - Logique Et Analyse 26 (3):345-357.
  28.  20
    A Semantical Theory of Analytic Implication.Alasdair Urquhart - 1973 - Journal of Philosophical Logic 2 (2):212 - 219.
  29. The Theory of Types.Alasdair Urquhart - 2003 - In Nicholas Griffin (ed.), The Cambridge Companion to Bertrand Russell. Cambridge University Press. pp. 286--309.
     
    Export citation  
     
    My bibliography   1 citation  
  30. Four Variables Suffice.Alasdair Urquhart - 2007 - Australasian Journal of Logic 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  
  31.  5
    Matrix Identities and the Pigeonhole Principle.Michael Soltys & Alasdair Urquhart - 2004 - 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  
  32.  5
    Nuel Belnap: Doctoral Students.Carlos Giannoni, Robert Meyer, J. Michael Dunn, Peter Woodruff, James Garson, Kent Wilson, Dorothy Grover, Ruth Manor, Alasdair Urquhart & Garrel Pottinger - 1990 - In J. Dunn & A. Gupta (eds.), Truth or Consequences. Kluwer Academic Publishers.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  33.  21
    Distributive Lattices with a Dual Homomorphic Operation. II.Alasdair Urquhart - 1981 - 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   2 citations  
  34.  25
    Completeness of Weak Implication.Alasdair I. F. Urquhart - 1971 - Theoria 37 (3):274-282.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  35.  7
    Implicational Formulas in Intuitionistic Logic.Alasdair Urquhart - 1974 - Journal of Symbolic Logic 39 (4):661-664.
  36.  23
    Mathematical Depth.Alasdair Urquhart - 2015 - 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  
  37.  26
    Beyond Analytic Philosophy.Alasdair Urquhart - 1987 - Canadian Journal of Philosophy 17 (2):477-482.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  38. The Collected Papers of Bertrand Russell, Volume 4: Foundations of Logic, 1903-05.Alasdair Urquhart & Albert C. Lewis (eds.) - 1994 - Routledge.
    First published in 1994. Routledge is an imprint of Taylor & Francis, an informa company.
     
    Export citation  
     
    My bibliography   1 citation  
  39.  23
    Decidability and the Finite Model Property.Alasdair Urquhart - 1981 - Journal of Philosophical Logic 10 (3):367 - 370.
  40.  33
    Henry M. Sheffer and Notational Relativity.Alasdair Urquhart - 2012 - 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  
  41.  30
    The Unnameable.Alasdair Urquhart - 2008 - 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 (5 more)  
     
    Export citation  
     
    My bibliography  
  42.  16
    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]Alasdair Urquhart - 2015 - Philosophia Mathematica 23 (3):435-438.
  43.  14
    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]Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4).
  44.  14
    Emil Post.Alasdair Urquhart - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--617.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45.  4
    Dishkant Hermann. The First Order Predicate Calculus Based on the Logic of Quantum Mechanics. Reports on Mathematical Logic, No. 3 , Pp. 9–17.Georgacarakos G. N.. Orthomodularity and Relevance. Journal of Philosophical Logic, Vol. 8 , Pp. 415–432.Georgacarakos G. N.. Equationally Definable Implication Algebras for Orthomodular Lattices. Studia Logica, Vol. 39 , Pp. 5–18.Greechie R. J. And Gudder S. P.. Is a Quantum Logic a Logic? Helvetica Physica Acta, Vol. 44 , Pp. 238–240.Hardegree Gary M.. The Conditional in Abstract and Concrete Quantum Logic. The Logico-Algehraic Approach to Quantum Mechanics, Volume II, Contemporary Consolidation, Edited by Hooker C. A., The University of Western Ontario Series in Philosophy of Science, Vol. 5, D. Reidel Publishing Company, Dordrecht, Boston, and London, 1979, Pp. 49–108.Hardegree Gary M.. Material Implication in Orthomodular Lattices. Notre Dame Journal of Formal Logic, Vol. 22 , Pp. 163–182.Jauch J. M. And Piron C.. What is “Quantum-Logic”? Qu. [REVIEW]Alasdair Urquhart - 1983 - Journal of Symbolic Logic 48 (1):206-208.
  46.  12
    Meaning and Modality. [REVIEW]Alasdair Urquhart - 1978 - Journal of Philosophy 75 (8):438-446.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  47.  29
    The Complexity of Analytic Tableaux.Noriko H. Arai, Toniann Pitassi & Alasdair Urquhart - 2006 - 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 (4 more)  
     
    Export citation  
     
    My bibliography  
  48.  2
    Modern Logic and Quantum Mechanics.Alasdair Urquhart & Rachel Wallace Garden - 1988 - Journal of Symbolic Logic 53 (2):648.
  49.  26
    The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - 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  
  50.  28
    Von Neumann, Gödel and Complexity Theory.Alasdair Urquhart - 2010 - 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 (4 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 151