140 found
Order:
  1.  41
    Semantics for Relevant Logics.Alasdair Urquhart - 1972 - Journal of Symbolic Logic 37 (1):159-169.
  2. 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  
     
    Bookmark   21 citations  
  3.  40
    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 (5 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  4.  25
    The Undecidability of Entailment and Relevant Implication.Alasdair Urquhart - 1984 - Journal of Symbolic Logic 49 (4):1059-1073.
  5.  39
    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 (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  6.  10
    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 (6 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  7.  33
    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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  21
    The Development of Modern Logic.Alasdair Urquhart - 2012 - Bulletin of Symbolic Logic 18 (2):268-270.
  9. 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  
     
    Bookmark   8 citations  
  10.  31
    Proof Theories for Semilattice Logics.Steve Giambrone & Alasdaire Urquhart - 1987 - Mathematical Logic Quarterly 33 (5):433-439.
  11.  33
    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 (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  12.  18
    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 (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  13.  23
    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  
     
    Bookmark   5 citations  
  14.  36
    Completeness of Weak Implication.Alasdair I. F. Urquhart - 1971 - Theoria 37 (3):274-282.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  15.  28
    Decidability and the Finite Model Property.Alasdair Urquhart - 1981 - Journal of Philosophical Logic 10 (3):367 - 370.
  16.  30
    A Semantical Theory of Analytic Implication.Alasdair Urquhart - 1973 - Journal of Philosophical Logic 2 (2):212 - 219.
  17. 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  
     
    Bookmark   3 citations  
  18.  23
    Handbook of Philosophical Logic.Alasdair Urquhart - 1987 - Canadian Journal of Philosophy 17 (2):483-489.
  19.  38
    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 (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20. Philosophical Relevance of the Interaction Between Mathematical Physics and Pure Mathematics.Alasdair Urquhart - 2008 - In Paolo Mancosu (ed.), The Philosophy of Mathematical Practice. Oxford University Press.
     
    Export citation  
     
    Bookmark   4 citations  
  21.  21
    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.
  22.  24
    An Interpretation of Many-Valued Logic.Alasdair Urquhart - 1973 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 19 (7):111-114.
  23.  82
    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 (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24.  9
    An Interpretation of Many‐Valued Logic.Alasdair Urquhart - 1973 - Mathematical Logic Quarterly 19 (7):111-114.
  25. 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 (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  12
    Implicational Formulas in Intuitionistic Logic.Alasdair Urquhart - 1974 - Journal of Symbolic Logic 39 (4):661-664.
  27.  31
    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  
     
    Bookmark   1 citation  
  28.  24
    The Complexity of Decision Procedures in Relevance Logic II.Alasdair Urquhart - 1999 - Journal of Symbolic Logic 64 (4):1774-1802.
  29.  7
    Russell's Zigzag Path to the Ramified Theory of Types.Alasdair Urquhart - 1988 - Russell: The Journal of Bertrand Russell Studies 8 (1):82.
  30.  20
    A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity.Alasdair Urquhart - 2007 - Bulletin of Symbolic Logic 13 (4):538-540.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  38
    Hermann Dishkant. The First Order Predicate Calculus Based on the Logic of Quantum Mechanics. Reports on Mathematical Logic, No. 3 , Pp. 9–17. - G. N. Georgacarakos. Orthomodularity and Relevance. Journal of Philosophical Logic, Vol. 8 , Pp. 415–432. - G. N. Georgacarakos. Equationally Definable Implication Algebras for Orthomodular Lattices. Studia Logica, Vol. 39 , Pp. 5–18. - R. J. Greechie and S. P. Gudder. Is a Quantum Logic a Logic?Helvetica Physica Acta, Vol. 44 , Pp. 238–240. - Gary M. Hardegree. The Conditional in Abstract and Concrete Quantum Logic. The Logico-Algehraic Approach to Quantum Mechanics, Volume II, Contemporary Consolidation, Edited by C. A. Hooker, The University of Western Ontario Series in Philosophy of Science, Vol. 5, D. Reidel Publishing Company, Dordrecht, Boston, and London, 1979, Pp. 49–108. - Gary M. Hardegree. Material Implication in Orthomodular Lattices. Notre Dame Journal of Formal Logic, Vol. 22 , Pp. 163–182. - J. M. Jauch and C. Piron. What is “Q. [REVIEW]Alasdair Urquhart - 1983 - Journal of Symbolic Logic 48 (1):206-208.
  32.  12
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  6
    First Degree Formulas in Quantified S5.Alasdair Urquhart - 2015 - Australasian Journal of Logic 12 (5).
    This note provides a proof that the formula L is not equivalent to any first degree formula in the context of the quantified version of the modal logic S5. This solves a problem posed by Max Cresswell.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  26
    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 (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  82
    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 (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  9
    Failure of Interpolation in Constant Domain Intuitionistic Logic.Grigori Mints, Grigory Olkhovikov & Alasdair Urquhart - 2013 - Journal of Symbolic Logic 78 (3):937-950.
  37.  43
    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 (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38. Intensional Languages Via Nominalization.Alasdair Urquhart - 1982 - Pacific Philosophical Quarterly 63 (2):186.
     
    Export citation  
     
    Bookmark   2 citations  
  39.  4
    [Omnibus Review].Alasdair Urquhart - 1983 - Journal of Symbolic Logic 48 (1):206-208.
  40.  44
    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  
     
    Bookmark   1 citation  
  41.  80
    Synonymous Logics: A Correction. [REVIEW]Francis Jeffry Pelletier & Alasdair Urquhart - 2008 - 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  
     
    Bookmark   1 citation  
  42.  51
    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 (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  16
    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 (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  9
    Correspondance Sur la Philosophie, la Logique Et la Politique Avec Louis Couturat.Alasdair Urquhart - 2005 - Bulletin of Symbolic Logic 11 (3):442-444.
  45.  34
    A Contractionless Semilattice Semantics.Steve Giambrone, Robert K. Meyer & Alasdair Urquhart - 1987 - Journal of Symbolic Logic 52 (2):526-529.
  46.  14
    Further Results on Proof Theories For Semilattice Logics.Robert K. Meyer, Errol P. Martin, Steve Giambrone & Alasdair Urquhart - 1988 - Mathematical Logic Quarterly 34 (4):301-304.
  47.  8
    G. F. Stout and the Theory of Descriptions.Alasdair Urquhart - 1994 - Russell: The Journal of Bertrand Russell Studies 14 (2):163.
  48.  11
    Simplified Lower Bounds for Propositional Proofs.Alasdair Urquhart & Xudong Fu - 1996 - Notre Dame Journal of Formal Logic 37 (4):523-544.
    This article presents a simplified proof of the result that bounded depth propositional proofs of the pigeonhole principle are exponentially large. The proof uses the new techniques for proving switching lemmas developed by Razborov and Beame. A similar result is also proved for some examples based on graphs.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  3
    The Complexity of Decision Procedures in Relevance Logic II.Alasdair Urquhart - 1999 - Journal of Symbolic Logic 64 (4):1774-1802.
  50.  3
    Modern Logic and Quantum Mechanics.Alasdair Urquhart - 1988 - Journal of Symbolic Logic 53 (2):648.
1 — 50 / 140