default search action
The Journal of Symbolic Logic, Volume 72
Volume 72, Number 1, March 2007
- Lev Yu. Glebsky
, E. I. Gordon, C. Ward Henson
On finite approximations of topological algebraic systems. 1-25 - Arnold Beckmann
Linear Kripke frames and Gödel logics. 26-44 - Ksenija Simic:
The pointwise ergodic theorem in subsystems of second-order arithmetic. 45-66 - Jana Maríková
Type-definable and invariant groups in o-minimal structures. 67-80 - Christopher P. Alfeld:
Non-branching degrees in the Medvedev lattice of Π01 classes. 81-97 - Reinhard Muskens
Intensional models for the theory of types. 98-118 - Ehud Hrushovski, Ya'acov Peterzil:
A question of van den Dries and a theorem of Lipshitz and Robinson; not everything is standard. 119-122 - Pavel Hrubes:
Theories very close to PA where Kreisel's Conjecture is false. 123-137 - Paul B. Larson:
The nonstationary ideal in the ℛmax extension. 138-158 - Jean-Baptiste Joinet
Completeness of MLL proof-nets w.r.t. weak distributivity. 159-170 - Denis R. Hirschfeldt, Richard A. Shore:
Combinatorial principles weaker than Ramsey's Theorem for pairs. 171-206 - Andreas Baudisch, Amador Martin-Pizarro
Red fields. 207-225 - Saharon Shelah
Power set modulo small, the singular of uncountable cofinality. 226-242 - Giorgi Japaridze
The logic of interactive Turing reduction. 243-276 - Iskander Sh. Kalimullin
Elementary differences between the (2p)-c. e. and the (2p+1)-c. e. enumeration degrees. 277-284 - Athanassios Tzouvaras:
A reduction of the NF consistency problem. 285-304 - Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare:
Bounding homogeneous models. 305-323 - Valentina S. Harizanov, Russell G. Miller:
Spectra of structures and relations. 324-348 - Bernhard König:
Forcing indestructibility of set-theoretic axioms. 349-360
Volume 72, Number 2, June 2007
- Carmi Merimovich:
A power function with a fixed finite gap everywhere. 361-417 - Richard Elwes
Asymptotic classes of finite structures. 418-438 - Sergei N. Artëmov, Rosalie Iemhoff:
The basic intuitionistic logic of proofs. 439-451 - MedYahya Ould MedSalem
Δ03-determinacy, comprehension and induction. 452-462 - Steven Vickers:
Sublocales in formal topology. 463-482 - L. S. Grinblat:
On sets not belonging to algebras. 483-500 - Rafal Filipów
Ideal convergence of bounded sequences. 501-512 - Yijia Chen, Jörg Flum, Martin Grohe
An analysis of the W*-hierarchy. 513-534 - Franz Baader
Connecting many-sorted theories. 535-583 - Lawrence Peter Belluce, Antonio Di Nola:
Simplicial structures in MV-algebras and logic. 584-600 - Benjamin Rossman:
Successor-invariant first-order logic on finite structures. 601-618 - Mihai Ganea:
Burgess' PV is Robinson's Q. 619-624 - Masanao Ozawa:
Transfer principle in quantum set theory. 625-648 - Jan Krajícek, Alan Skelley, Neil Thapen:
NP search problems in low fragments of bounded arithmetic. 649-672 - Robin Hirsch
Relation algebra reducts of cylindric algebras and complete representations. 673-703 - Gunnar Wilken
Assignment of ordinals to patterns of resemblance. 704-720
Volume 72, Number 3, September 2007
- John R. Steel:
Local Kc constructions. 721-737 - Kazushige Terui:
Which structural rules admit cut elimination? An algebraic criterion. 738-754 - John Kenneth Truss:
On notions of genericity and mutual genericity. 755-766 - Federico De Marchi, Benno van den Berg:
Models of non-well-founded sets via an indexed final coalgebra theorem. 767-791 - Silvia Barbina, Dugald Macpherson:
Reconstruction of homogeneous relational structures. 792-802 - Rong Zhang, Zhaohui Zhu:
An algebraic characterization of equivalent preferential models. 803-833 - George Metcalfe
Substructural fuzzy logics. 834-864 - Uri Abraham, James Cummings
Some results in polychromatic Ramsey theory. 865-896 - Thomas Forster:
Erdos-Rado without choice. 897-900 - Julia F. Knight, Sara Miller, Michael Vanden Boom:
Turing computable embeddings. 901-918 - Clifton F. Ealy, Alf Onshuus
Characterizing rosy theories. 919-940 - Pavel Hrubes:
Lower bounds for modal logics. 941-958 - Emil Jerábek
Approximate counting in bounded arithmetic. 959-993 - George Kourousias
Parallel interpolation, splitting, and relevance in belief change. 994-1002 - John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey:
Π10 classes and strong degree spectra of relations. 1003-1018 - Assaf Hasson
DMP in strongly minimal sets. 1019-1030 - John Chisholm, Julia F. Knight, Sara Miller:
Computable embeddings and strongly minimal theories. 1031-1040 - Bakhadyr Khoussainov, Pavel Semukhin
Applications of Kolmogorov complexity to computable model theory. 1041-1054 - Barbara F. Csima, Richard A. Shore:
The settling-time reducibility ordering. 1055-1071 - Andrés Cordón-Franco
A note on Σ1-maximal models. 1072-1078 - Alessandro Berarducci
Corrigendum to: "Transfer methods for o-minimal topology". 1079-1080
Volume 72, Number 4, December 2007
- John D. Clemens:
Classifying Borel automorphisms. 1081-1092 - Jennifer Brown:
Cellularity and the structure of pseudo-trees. 1093-1107 - Pantelis E. Eleftheriou
Groups definable in ordered vector spaces over ordered division rings. 1108-1140 - Itaï Ben Yaacov, Bruno Poizat:
Fondements de la logique positive. 1141-1162 - Byunghan Kim, Rahim Moosa:
Stable definability and generic relations. 1163-1176 - Alessandro Berarducci
O-minimal spectra, infinitesimal subgroups and cohomology. 1177-1193 - Tobias J. Hagge:
QL(ℂn) determines n. 1194-1196 - Rick Statman:
On the complexity of alpha conversion. 1197-1203 - Giovanna Corsi, Gabriele Tassi:
Intuitionistic logic freed of all metarules. 1204-1218 - Chi Tat Chong, Liang Yu:
Maximal chains in the Turing degrees. 1219-1227 - Heike Mildenberger:
There may be infinitely many near-coherence classes under 픲 < 픡. 1228-1238 - Alexander A. Razborov:
Flag algebras. 1239-1282 - Mor Doron, Saharon Shelah
Relational structures constructible by quantifier free definable operations. 1283-1298 - Jonas Reitz:
The ground axiom. 1299-1317 - Shahram Mohsenipour:
A note on subsystems of open induction. 1318-1322 - Jakob Kellner
Winning the pressing down game but not Banach-Mazur. 1323-1335 - Joshua Buresh-Oppenheim, Toniann Pitassi:
The complexity of resolution refinements. 1336-1352 - Stephen A. Cook, Jan Krajícek:
Consequences of the provability of NP ⊆ P/poly. 1353-1371 - Richard Ketchersid, Paul B. Larson, Jindrich Zapletal
Increasing δ12 and Namba-style forcing. 1372-1378 - Douglas S. Bridges, Hannes Diener:
The pseudocompactness of [0, 1] is equivalent to the uniform continuity theorem. 1379-1384 - James H. Andrews:
An untyped higher order logic with Y combinator. 1385-1404 - Thomas F. Kent, Andrea Sorbi:
Bounding nonsplitting enumeration degrees. 1405-1417 - Wesley Calvert, Ekaterina B. Fokina
Index sets for classes of high rank structures. 1418-1432
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-12-13 19:09 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: