default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 35
Volume 35, Number 1, Winter 1994
- Henryk Kotlarski, Richard Kaye:
Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups. 1-14 - Roland Hinnion:
Naive Set Theory with Extensionality in Partial Logic and in Paradoxical Logic. 15-40 - Marie La Palme Reyes, John Macnamara, Gonzalo E. Reyes:
Functoriality and Grammatical Role in Syllogisms. 41-66 - Gian Aldo Antonelli:
The Complexity of Revision. 67-72 - Eric Hammer:
Reasoning with Sentences and Diagrams. 73-87 - Ramon Jansana
:
Some Logics Related to von Wright's Logic of Place. 88-98 - David Charles McCarty:
On Theorems of Gödel and Kreisel: Completeness and Markov's Principle. 99-107 - Stephen Pollard, Norman M. Martin:
Contractions of Closure Systems. 108-115 - Greg Restall:
Subintuitionistic Logics. 116-129 - David Auerbach:
Saying it with Numerals. 130-146 - Domenico Zambella:
Shavrukov's Theorem on the Subalgebras of Diagonalizable Algebras for Theories Containing I Δ0s + exp. 147-157
Volume 35, Number 2, Spring 1994
- V. Yu. Shavrukov:
A Smart Child of Peano's. 161-185 - Franco Montagna, Antonella Mancini:
A Minimal Predicative Set Theory. 186-203 - Gian Aldo Antonelli:
A Revision-Theoretic Analysis of the Arithmetical Hierarchy. 204-218 - Ryuichi Hori, Hiroakira Ono, Harold Schellinx:
Extending Intuitionistic Linear Logic with Knotted Structural Rules. 219-242 - C. F. M. Vermeulen:
Incremental Semantics for Propositional Texts. 243-271 - Eduardo Mizraji:
Modalities in Vector Logic. 272-283 - Leon Horsten:
Modal-Epistemic Variants of Shapiro's System of Epistemic Arithmetic. 284-291 - Christopher C. Leary:
The Structure of Pleasant Ideals. 292-298
Volume 35, Number 3, Summer 1994
- Volker Halbach:
A System of Complete and Consistent Truth. 311-327 - James D. Sharp, Simon Thomas:
Uniformization Problems and the Cofinality of the Infinite Symmetric Group. 328-345 - Giorgi Japaridze:
A Simple Proof of Arithmetical Completeness for Π1-conservativity Logic. 346-354 - Hiroshi Aoyama:
The Strong Completeness of a System Based on Kleene's Strong Three-Valued Logic. 355-368 - Josep Maria Font, Gonzalo Rodríguez:
Algebraic Study of Two Deductive Systems of Relevance Logic. 369-397 - R. Chartrand, Thomas G. Kucera:
Deissler Rank Complexity of Powers of Indecomposable Injective Modules. 398-402 - Makoto Kikuchi, Kazuyuki Tanaka:
On Formalization of Model-Theoretic Proofs of Gödel's Theorems. 403-412 - Hartmut Höft, Paul E. Howard:
Well Ordered Subsets of Linearly Ordered Sets. 413-425 - Patrizio Cintioli, Sauro Tulipani:
Σ11-Completeness of a Fragment of the Theory of Trees With Subtree Relation. 426-432 - Wallace A. Murphree:
The Irrelevance of Distribution for the Syllogism. 433-449 - Michael Zakharyaschev:
A New Solution to a Problem of Hosoi and Ono. 450-457 - Ralf-Dieter Schindler:
A Dilemma in the Philosophy of Set Theory. 458-463
Volume 35, Number 4, Fall 1994
- Claudio Cerrato:
Natural Deduction Based upon Strict Implication for Normal Modal Logics. 471-495 - Zlatan Damnjanovic:
Elementary Functions and LOOP Programs. 496-522 - Benedetto Intrigila:
Some Results on Numerical Systems in lambda-Calculus. 523-541 - Greg Hjorth:
Π11 Wellfounded Relations. 542-549 - Hajnal Andréka, Roger D. Maddux:
Representations for Small Relation Algebras. 550-562 - Giovanna D'Agostino:
Topological Structure of Diagonalizable Algebras and Corresponding Logical Properties of Theories. 563-572 - Patricia Johann:
Normal Forms in Combinatory Logic. 573-594 - Tomasz F. Skura:
Syntactic Refutations against Finite Models in Modal Logic. 595-605
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-05 21:04 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:
