default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 42
Volume 42, Number 1 , 2001
- Katsumasa Ishii, Ryo Kashima
, Kentaro Kikuchi:
Sequent Calculi for Visser's Propositional Logics. 1-22 - Tapani Hyttinen, Matti J. Pauna:
On Non-wellfounded Sets as Fixed Points of Substitutions. 23-40 - Dorella Bellè, Franco Parlamento:
The Decidability of the ∀*∃ Class and the Axiom of Foundation. 41-53 - Osamu Morikawa:
Extended Gentzen-type Formulations of Two Temporal Logics Based on Incomplete Knowledge Systems. 55-64
Volume 42, Number 2, 2001
- Lorenzo Sacchetti:
The Fixed Point Property in Modal Logic. 65-86 - Athanassios Tzouvaras:
Periodicity of Negation. 87-99 - Moulhime El Bekkali:
Pseudo Treealgebras. 101-108 - Antonella Mancini, Domenico Zambella:
A Note on Recursive Models of Set Theories. 109-115 - Toshio Suzuki:
Forcing Complexity: Minimum Sizes of Forcing Conditions. 117-120 - Kees Doets:
Uniform Short Proofs for Classical Theorems. 121-127
Volume 42, Number 3, 2001
- John T. Baldwin, Saharon Shelah:
Model Companions of TAut for Stable T. 129-142 - Takeshi Yamazaki:
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic. 143-148 - Mark F. Sharlow:
Broadening the Iterative Conception of Set. 149-170
Volume 42, Number 4, 2001
- Ahti-Veikko Pietarinen:
Propositional Logic of Imperfect Information: Foundations and Applications. 193-210 - Olga Ambas:
Anshakov-Rychkov Algebras. 211-224 - Sergio A. Celani, Ramon Jansana:
A Closer Look at Some Subintuitionistic Logics. 225-255
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-11 21:17 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:
