default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 42
Volume 42, 1996
- Fernando Ferreira
:
On End-Extensions of Models of ¬exp. 1-18 - Vladimir Kanovei, Michael Reeken:
Loeb Measure from the Point of View of a Coin Flipping Game. 19-26 - Eduardo Mizraji:
The Operators of Vector Logic. 27-40 - Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Decidability of ∃*∀-Sentences in Membership Theories. 41-58 - Michael Rathjen:
The Recursively Mahlo Property in Second Order Arithmetic. 59-66 - V. Yu. Shavrukov:
Remarks on Uniformly Finitely Precomplete Positive Equivalences. 67-82 - Geoffrey LaForte:
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees. 83-103 - Olivier Esser:
Inconsistency of GPK + AFA. 104-108 - Ivan N. Soskov:
Intrinsically II11 Relations. 109-126 - Caterina Bianchini, Andrea Sorbi:
A Note an Closed Degrees of Difficulty of the Medvedev Lattice. 127-133 - Salah Labhalla, Henri Lombardi:
Analyse de complexité pour un théorème de Hall sur les fractions continues. 134-144 - Frank Wolter:
Tense Logic Without Tense Operators. 145-171 - Markus Huberich:
A Note on Boolean Algebras with Few Partitions Modulo some Filter. 172-174 - Peter Apostoli:
Modal Aggregation and the Theory of Paraconsistent Filters. 175-190 - S. Barry Cooper:
Strong Minimal Covers for Recursively Enumerable Degrees. 191-196 - Claudio Cerrato:
Modal Tree-Sequents. 197-210 - Arthur W. Apter:
A Cardinal Pattern Inspired by AD. 211-218 - John L. Bell:
Polymodal Lattices and Polymodal Logic. 219-233 - Lo Czukai, Renren Liu:
The Maximal Closed Classes of Unary Functions in p-Valued Logic. 234-240 - Valentina S. Harizanov:
Effectively and Noneffectively Nowhere Simple Sets. 241-248 - Xiaoding Yi:
Splittings of 0' into the Recursively Enumerable Degrees. 249-269 - Andrea Cantini:
Asymmetric Interpretations for Bounded Theories. 270-288 - John L. Bell, Silvia Gebellato:
Precovers, Modalities and Universal Closure Operators in a Topos. 289-299 - Silvio Valentini:
Decidability in Intuitionistic Type Theory is Functionally Decidable. 300-304 - Giacomo Bonanno:
On the Logic of Common Belief. 305-311 - Holger Petersen:
The Computation of Partial Recursive Word-Functions Without Read Instructions. 312-318 - Matthias Baaz, Norbert Brunner, Karl Svozil:
The Axiom of Choice in Quantum Theory. 319-340 - Joaquín Borrego-Díaz, Alejandro Fernández-Margarit, Mario J. Pérez-Jiménez:
On Overspill Principles and Axiom Schemes for Bounded Formulas. 341-348 - Karim Nour:
Storage Operators and ∀-positive Types in TTR Type System. 349-368 - Carlo Toffalori:
Decidability for ℤ[G]-Modules when G is Cyclic of Prime Order. 369-378 - Qing Zhou:
Computable Real-Valued Functions on Recursive Open and Closed Subsets of Euclidean Space. 379-409 - Paul E. Howard, Jean E. Rubin:
The Boolean Prime Ideal Theorem Plus Countable Choice Do Not Imply Dependent Choice. 410-420 - Tapani Hyttinen:
Forking and Incomplete Types. 421-432 - Carlo Toffalori:
Some Decidability Results for ℤ[G]-Modules when G is Cyclic of Squarefree Order. 433-445 - Dario Maguolo, Silvio Valentini:
An Intuitionistic Version of Cantor's Theorem. 446-448 - George Tourlakis:
Recursion in Partial Type-1 Objects With Well-Behaved Oracles. 449-460 - Christopher J. Ash, Julia F. Knight:
Recursive Structures and Ershov's Hierarchy. 461-468 - Ivan N. Soskov:
Intrinsically Hyperarithmetical Sets. 469-480 - Frank Wolter:
Properties of Tense Logics. 481-500 - Guido Bertolotti, Pierangelo Miglioli, Daniela Silvestrini:
Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property. 501-536 - J. Donald Monk:
Minimum-sized Infinite Partitions of Boolean Algebras. 537-550 - Lawrence Peter Belluce, Antonio Di Nola:
Yosida Type Representation for Perfect MV-Algebras. 551-563 - Kam-Chau Wong:
Computability of Minimizers and Separating Hyperplanes. 564-568 - Martin Grohe:
Some Remarks on Finite Löwenheim-Skolem Theorems. 569-571
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:
