default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 32
Volume 32, Number 1, Winter 1991
- Peter Roeper, Hugues Leblanc:
Indiscernability and Identiy in Probability Theory. 1-46 - Aldo Bressan:
New Semantics for the Extensional but Hyper-intensional Part Lα of the Modal Sense Language SLαν. 47-86 - Richard Blecksmith, Gilbert Null:
Matrix Representation of Husserl's Part-Whole-Foundation Theory. 87-111 - Carlo Toffalori:
Stability for Pairs of Equivalence Relations. 112-128 - Charles J. Kelly:
The Logic of the Liar from the Standpoint of the Aristotelian Syllogistic. 129-146 - Arnon Avron:
Relevance and Paraconsistency - A New Approach, Part III: Cut-Free Gentzen-Type Systems. 147-160
Volume 32, Number 2, Spring 1991
- Tapani Hyttinen:
Preservation by Homomorphisms and Infinitary Languages. 167-172 - Ludomir Newelski:
On Type Definable Subgroups of a Stable Group. 173-187 - Dugald Macpherson
:
Finite Axiomatizability and Theories with Trivial Algebraic Closure. 188-192 - Graham Priest:
Intensional Paradoxes. 193-211 - Hugues Leblanc, Peter Roeper, Michael Thau, George Weaver:
Henkin's Completeness Proof: Forty Years Later. 212-232 - Karol Habart:
Bounds in Weak Truth-Table Reducibility. 233-242 - Loredana Biacino, Giangiacomo Gerla:
Connection Structures. 242-247 - Bruce E. R. Thompson:
Why is Conjunctive Simplication Invalid? 248-254 - Julius B. Barbanel:
Almost Hugeness and a Related Notion. 255-265 - Andrea Sorbi:
Embedding Brouwer Algebras in the Medvedev Lattice. 266-275 - Anthony Willing:
Buridan's Divided Modal Syllogistic. 276-289 - Alexander Abian, Wael A. Amin:
The Cardinality of Powersets in Finite Models of the Powerset Axiom. 290-293 - Robert D. Carnes, Philip L. Peterson:
Intermediate Quantifiers Versus Percentages. 294-306 - Karl Schlechta:
Theory Revision and Probability. 307-319
Volume 32, Number 3, Summer 1991
- David Charles McCarty:
Incompleteness in Intuitionistic Metamathematics. 323-358 - Gonzalo E. Reyes:
A Topos-Theoretic Approach to Reference and Modality. 359-391 - Roman Kossak, James H. Schmerl:
Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic. 392-398 - Richard Kaye:
On Cofinal Extensions of Models of Fragments of Arithmetic. 399-408 - William C. Purdy:
A Logic for Natural Language. 409-425 - David Marker:
End Extensions of Normal Models of Open Induction. 426-431 - Francesco Orilia:
Type-Free Property Theory, Exemplification and Russell's Paradox. 432-447 - Renling Jin:
Some Independence Results Related to the Kurepa Tree. 448-457 - Jody Azzouni:
A Simple Axiomatizable Theory of Truth. 458-493
Volume 32, Number 4, Fall 1991
- Rodney G. Downey:
On Π10 Classes and their Ranked Points. 499-512 - David Charles McCarty:
Polymorphism and Apartness. 513-532 - Wim Ruitenburg:
Inequality in Constructive Mathematics. 533-553 - Albert Visser:
On the Σ10-Conservativity of Σ10-Completeness. 554-561 - Alessandra Carbone:
Provable Fixed Points in I Δ0 + Ω1. 562-572 - Henryk Kotlarski:
Full Satisfaction Classes: A Survey. 573-579 - Kosta Dosen:
Ancestral Kripke Models and Nonhereditary Kripke Models for the Heyting Propositional Calculus. 580-597 - Juan Barba Escriba:
A Multidimensional Modal Translation for a Formal System Motivated by Situation Semantics. 598-608 - Renato A. Lewin, Irene F. Mikenberg, María G. Schwarze:
C1 Is Not Algebraizable. 609-611 - Christopher C. Leary:
Pleasant Ideals. 612-617 - Claudio E. A. Pizzi:
Decision Procedures for Logics of Consequential Implication. 618-636 - Carlo Toffalori:
Classifying Pairs of Equivalence Relations. 637-650
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
