36 found
Order:
Disambiguations
George Weaver [31]George E. Weaver [10]George F. Weaver [1]George Sumner Weaver [1]
  1.  78
    Logical Consequence in Modal Logic.John Corcoran & George Weaver - 1969 - Notre Dame Journal of Formal Logic 10 (4):370-384.
    This paper develops a modal, Sentential logic having "not", "if...Then" and necessity as logical constants. The semantics (system of meanings) of the logic is the most obvious generalization of the usual truth-Functional semantics for sentential logic and its deductive system (system of demonstrations) is an obvious generalization of a suitable (jaskowski-Type) natural deductive system for sentential logic. Let a be a set of sentences and p a sentence. "p is a logical consequence of a" is defined relative to the semantics (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  44
    Back and forth constructions in modal logic: An interpolation theorem for a family of modal logics.George Weaver & Jeffrey Welaish - 1986 - Journal of Symbolic Logic 51 (4):969-980.
  3.  52
    Homogeneous and universal dedekind algebras.George Weaver - 2000 - Studia Logica 64 (2):173-192.
    A Dedekind algebra is an order pair (B, h) where B is a non-empty set and h is a similarity transformation on B. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are 0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type which occur in the decomposition of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  4.  16
    The Fraenkel‐Carnap question for Dedekind algebras.George Weaver & Benjamin George - 2003 - Mathematical Logic Quarterly 49 (1):92-96.
    It is shown that the second-order theory of a Dedekind algebra is categorical if it is finitely axiomatizable. This provides a partial answer to an old and neglected question of Fraenkel and Carnap: whether every finitely axiomatizable semantically complete second-order theory is categorical. It follows that the second-order theory of a Dedekind algebra is finitely axiomatizable iff the algebra is finitely characterizable. It is also shown that the second-order theory of a Dedekind algebra is quasi-finitely axiomatizable iff the algebra is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  5.  79
    Structuralism and representation theorems.George Weaver - 1998 - Philosophia Mathematica 6 (3):257-271.
    Much of the inspiration for structuralist approaches to mathematics can be found in the late nineteenth- and early twentieth-century program of characterizing various mathematical systems upto isomorphism. From the perspective of this program, differences between isomorphic systems are irrelevant. It is argued that a different view of the import of the differences between isomorphic systems can be obtained from the perspective of contemporary discussions of representation theorems and that from this perspective both the identification of isomorphic systems and the reduction (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6. Logical consequence in modal logic II: Some semantic systems for S4.George Weaver - 1974 - Notre Dame Journal of Formal Logic 15:370.
    ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be equivalent; (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  15
    Effects of poststimulus study time on recognition of pictures.George E. Weaver - 1974 - Journal of Experimental Psychology 103 (4):799.
  8.  41
    Finite Partitions and Their Generators.George Weaver - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):255-260.
  9.  38
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  23
    From finitary to infinitary second‐order logic.George Weaver & Irena Penev - 2005 - Mathematical Logic Quarterly 51 (5):499-506.
    A back and forth condition on interpretations for those second-order languages without functional variables whose non-logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be equivalent in the language. When applied to second-order languages with an infinite non-logical vocabulary, excluding functional constants, the back and forth condition is sufficient but not necessary. It is shown that there is a class of infinitary second-order languages whose non-logical (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  36
    Retroactive facilitation in short-term retention of minimally learned paired associates.Darryl Bruce & George E. Weaver - 1973 - Journal of Experimental Psychology 100 (1):9.
  12.  41
    (1 other version)A Note on the Interpolation Theorem in First Order Logic.George Weaver - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (14-18):215-218.
  13.  42
    Compactness theorems for finitely-many-valued sentenial logics.George Weaver - 1978 - Studia Logica 37 (4):413 - 416.
  14.  42
    First Order Properties of Relations with the Monotonic Closure Property.George Weaver & Raymond D. Gumb - 1982 - Mathematical Logic Quarterly 28 (1-3):1-5.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  41
    Reading proofs with understanding.George Weaver - 1988 - Theoria 54 (1):31-47.
  16.  26
    The First-Order Theories of Dedekind Algebras.George Weaver - 2003 - Studia Logica 73 (3):337-365.
    A Dedekind Algebra is an ordered pair (B,h) where B is a non-empty set and h is an injective unary function on B. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called configurations of the Dedekind algebra. There are N0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on omega called its configuration signature. The configuration signature of a Dedekind algebra counts the number of configurations in the decomposition of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  17.  13
    Interpolated task characteristics and interference in short-term memory.Charles P. Bird & George E. Weaver - 1975 - Bulletin of the Psychonomic Society 6 (1):93-95.
  18.  27
    A note on definability in equational logic.George Weaver - 1994 - History and Philosophy of Logic 15 (2):189-199.
    After an introduction which demonstrates the failure of the equational analogue of Beth?s definability theorem, the first two sections of this paper are devoted to an elementary exposition of a proof that a functional constant is equationally definable in an equational theory iff every model of the set of those consequences of the theory that do not contain the functional constant is uniquely extendible to a model of the theory itself.Sections three, four and five are devoted to applications and extensions (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  33
    Unifying some modifications of the Henkin construction.George Weaver - 1992 - Notre Dame Journal of Formal Logic 33 (3):450-460.
  20.  42
    Henkin's completeness proof: forty years later.Hugues Leblanc, Peter Roeper, Michael Thau & George Weaver - 1991 - Notre Dame Journal of Formal Logic 32 (2):212-232.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  18
    The a-b, b-c, a-c mediation paradigm: The effects of variation in a-c study- and test-interval lengths and strength of a-b or b-c.Rudolph W. Schulz & George E. Weaver - 1968 - Journal of Experimental Psychology 76 (2p1):291.
  22.  26
    Directed attention and the recognition of pictures.Claudia J. Stanny & George E. Weaver - 1980 - Bulletin of the Psychonomic Society 15 (6):410-412.
  23.  22
    Effects of processing tasks on the recognition of pictures.Claudia J. Stanny & George F. Weaver - 1985 - Bulletin of the Psychonomic Society 23 (2):116-118.
  24.  54
    A-b, b-c, a-c mediation paradigm: Recall of a-b following varying numbers of trials of a-c learning.George E. Weaver & Rudolph W. Schulz - 1968 - Journal of Experimental Psychology 78 (1):113.
  25.  30
    A General Setting for Dedekind's Axiomatization of the Positive Integers.George Weaver - 2011 - History and Philosophy of Logic 32 (4):375-398.
    A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  30
    A Note on the Compactness Theorem in First Order Logic.George Weaver - 1980 - Mathematical Logic Quarterly 26 (7-9):111-113.
  27.  46
    Classifying ℵo-categorical theories II: The existence of finitely axiomatizable proper class II theories.George Weaver & David Lippel - 1998 - Studia Logica 60 (2):275-297.
    Clark and Krauss [1977] presents a classification of complete, satisfiable and o-categorical theories in first order languages with finite non-logical vocabularies. In 1988 the first author modified this classification and raised three questions about the distribution of finitely axiomatizable theories. This paper answers two of those questions.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  28.  21
    (1 other version)Extending ω‐consistent sets to maximally consistent, ω‐complete sets.George Weaver, Michael Thau & Hugues Leblanc - 1990 - Mathematical Logic Quarterly 36 (5):381-383.
  29.  19
    Hermes algebras.George Weaver & Edward Thompson - 2002 - Bulletin of the Section of Logic 31 (4):217-229.
  30.  24
    Quasi-finitely characterizable and finitely characterizable Dedekind algebras.George Weaver & Benjamin George - 2002 - Bulletin of the Section of Logic 31 (2):145-157.
  31.  31
    Simple expansions of classes satisfying Fraenkel-Carnap properties.George Weaver & Irena Penev - 2010 - Bulletin of the Section of Logic 39 (3/4):175-186.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  78
    Syntactic features and synonymy relations: A unified treatment of some proofs of the compactness and interpolation theorems.George E. Weaver - 1994 - Studia Logica 53 (2):325 - 342.
    This paper introduces the notion of syntactic feature to provide a unified treatment of earlier model theoretic proofs of both the compactness and interpolation theorems for a variety of two valued logics including sentential logic, first order logic, and a family of modal sentential logic includingM,B,S 4 andS 5. The compactness papers focused on providing a proof of the consequence formulation which exhibited the appropriate finite subset. A unified presentation of these proofs is given by isolating their essential feature and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  33.  32
    Successive interpolation and first-list recall in the A-B, A-C and A-B, D-C paradigms.George E. Weaver & Gary I. Danielson - 1969 - Journal of Experimental Psychology 81 (2):394.
  34.  48
    Stimulus meaningfulness, transfer, and retroactive inhibition in the A-B, A-C paradigm.George E. Weaver, Robert L. McCann & Robert J. Wehr - 1970 - Journal of Experimental Psychology 85 (2):255.
  35.  35
    The a-b, b-c, a-c mediation paradigm: A-c performance in the absence of study trials.George E. Weaver, Ronald H. Hopkins & Rudolf W. Schulz - 1968 - Journal of Experimental Psychology 77 (4):670.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  37
    The Fraenkel-Carnap Question for Limited Higher-Order Languages.George Weaver & B. George - 2010 - Bulletin of the Section of Logic 39 (1/2):1-9.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation