![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
The Bulletin of Symbolic Logic, Volume 14
Volume 14, Number 1, March 2008
- Ian Pratt-Hartmann
:
On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. 1-28 - Denis Bonnay:
Logicality and Invariance. 29-68
- Peter Cholak, Rodney G. Downey, Leo Harrington:
The Complexity of Orbits of Computably Enumerable Sets. 69-87 - Eric Jaligot, Alexey Muranov
, Azadeh Neman:
Independence Property and Hyperbolic Groups. 88-98 - Matteo Viale:
Forcing Axioms, Supercompact Cardinals, Singular Cardinal Combinatorics. 99-113
Volume 14, Number 2, June 2008
- Sasha Rubin
:
Automata Presenting Structures: A Survey of the Finite String Case. 169-209 - Siegfried Gottwald:
Mathematical Fuzzy Logics. 210-239 - Jan von Plato:
Gentzen's Proof of Normalization for Natural Deduction. 240-257
Volume 14, Number 3, September 2008
- Steven Awodey:
A Brief Introduction to Algebraic Set Theory. 281-298 - Nachum Dershowitz, Yuri Gurevich:
A Natural Axiomatization of Computability and Proof of Church's Thesis. 299-350 - Akihiro Kanamori:
Cohen and Set Theory. 351-378 - Dana S. Scott, Dominic McCarty:
Reconsidering Ordered Pairs. 379-397
Volume 14, Number 4, December 2008
- Vladimir Pestov:
Hyperlinear and Sofic Groups: A Brief Guide. 449-480 - Rafal Gruszczynski
, Andrzej Pietruszczak
:
Full Development of Tarski's Geometry of Solids. 481-540
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.