This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

17 found
Order:
  1. added 2018-11-07
    Preservation of Structural Properties in Intuitionistic Extensions of an Inference Relation.Tor Sandqvist - 2018 - Bulletin of Symbolic Logic 24 (3):291-305.
    The article approaches cut elimination from a new angle. On the basis of an arbitrary inference relation among logically atomic formulae, an inference relation on a language possessing logical operators is defined by means of inductive clauses similar to the operator-introducing rules of a cut-free intuitionistic sequent calculus. The logical terminology of the richer language is not uniquely specified, but assumed to satisfy certain conditions of a general nature, allowing for, but not requiring, the existence of infinite conjunctions and disjunctions. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. added 2018-06-07
    Sistema Experto en Deducción dentro de la Lógica Normal Trivalente.Gabriel Garduño-Soto, David René Thierry García, Rafael Vidal Uribe & Hugo Padilla Chacón - 1990 - In VIa. Conferencia Internacional: Las Computadoras en Instituciones de Educación y de Investigación. Cómputo Académico, UNAM, UNISYS, México, octubre 3–5, 1990. Mexico City: National Autonomous University of Mexico.
    Proceeding of the work in trivalent logic developped under the direction of the professor Hugo Padilla Chacón at the 90's at the National Autonome University of México. Program in RLisp.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. added 2017-02-11
    Review: Jon Barwise, Applications of Strict $Pi^1_1$ Predicates to Infinitary Logic. [REVIEW]N. J. Cutland - 1974 - Journal of Symbolic Logic 39 (2):335-336.
  4. added 2017-01-16
    Barwise Jon. Infinitary Logic and Admissible Sets.E. G. K. Lopez-Escobar - 1971 - Journal of Symbolic Logic 36 (1):156-157.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5. added 2015-03-20
    Review: Jon Barwise, Infinitary Logic and Admissible Sets. [REVIEW]E. G. K. Lopez-Escobar - 1971 - Journal of Symbolic Logic 36 (1):156-157.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. added 2014-03-31
    Infinitary Logics and Very Sparse Random Graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
    Let L ω ∞ω be the infinitary language obtained from the first-order language of graphs by closure under conjunctions and disjunctions of arbitrary sets of formulas, provided only finitely many distinct variables occur among the formulas. Let p(n) be the edge probability of the random graph on n vertices. It is shown that if p(n) ≪ n -1 satisfies certain simple conditions on its growth rate, then for every σ∈ L ω ∞ω , the probability that σ holds for the (...)
    Remove from this list   Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  7. added 2014-03-21
    Barwise: Infinitary Logic and Admissible Sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
    Remove from this list   Direct download (12 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. added 2014-03-14
    Infinitary Logic.John L. Bell - 2008 - Stanford Encyclopedia of Philosophy.
    Traditionally, expressions in formal systems have been regarded as signifying finite inscriptions which are—at least in principle—capable of actually being written out in primitive notation. However, the fact that (first-order) formulas may be identified with natural numbers (via "Gödel numbering") and hence with finite sets makes it no longer necessary to regard formulas as inscriptions, and suggests the possibility of fashioning "languages" some of whose formulas would be naturally identified as infinite sets . A "language" of this kind is called (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9. added 2014-03-10
    When Best Theories Go Bad.David Manley - 2009 - Philosophy and Phenomenological Research 78 (2):392-405.
    It is common for contemporary metaphysical realists to adopt Quine's criterion of ontological commitment while at the same time repudiating his ontological pragmatism. 2 Drawing heavily from the work of others—especially Joseph Melia and Stephen Yablo—I will argue that the resulting approach to meta-ontology is unstable. In particular, if we are metaphysical realists, we need not accept ontological commitment to whatever is quantified over by our best first-order theories.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. added 2010-09-27
    Supervenience and Infinitary Logic.Michael Glanzberg - 2001 - Noûs 35 (3):419-439.
    The discussion of supervenience is replete with the use of in?nitary logical operations. For instance, one may often ?nd a supervenient property that corresponds to an in?nite collection of supervenience-base properties, and then ask about the in?nite disjunction of all those base properties. This is crucial to a well-known argument of Kim (1984) that supervenience comes nearer to reduction than many non-reductive physicalists suppose. It also appears in recent discussions such as Jackson (1998).
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  11. added 2010-09-27
    Stationary Sets and Infinitary Logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
    Let K 0 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ is disjoint from a club, and let K 1 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{ is regular, then no sentence of L λ+κ separates K 0 λ and K 1 λ . On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{ , and a forcing axiom (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12. added 2010-09-27
    A Model Existence Theorem in Infinitary Propositional Modal Logic.Krister Segerberg - 1994 - Journal of Philosophical Logic 23 (4):337 - 367.
  13. added 2010-09-27
    Infinitary Propositional Normal Modal Logic.Slavian Radev - 1987 - Studia Logica 46 (4):291 - 309.
    A logic with normal modal operators and countable infinite conjunctions and disjunctions is introduced. A Hilbert's style axiomatization is proved complete for this logic, as well as for countable sublogics and subtheories. It is also shown that the logic has the interpolation property.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  14. added 2010-09-27
    A Complete Infinitary Logic.Kenneth Slonneger - 1976 - Journal of Symbolic Logic 41 (4):730-746.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  15. added 2010-09-27
    The Completeness Theorem for Infinitary Logic.Richard Mansfield - 1972 - Journal of Symbolic Logic 37 (1):31-34.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  16. added 2010-09-27
    Applications of Strict Π11 Predicates to Infinitary Logic.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (3):409 - 423.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17. added 2010-09-27
    Infinitary Logic and Admissible Sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   27 citations