UB Paderborn / Katalog / Suche / in CDI

Model Theory and Arithmetic: Comptes Rendus d'une Action Thématique Programmée du C.N.R.S. sur la Théorie des Modèles et l'Arithmétique, Paris, France, 1979/80

1981

Link zum Volltext

Verfügbarkeit prüfen

Bootstrapping, part I

Annals of pure and applied logic, 2010, Vol.161 (4), p.511-533

2010

Link zum Volltext

Verfügbarkeit prüfen

Computer science and the fine structure of Borel sets

Theoretical computer science, 2001, Vol.257 (1), p.85-105

2001

Link zum Volltext

Verfügbarkeit prüfen

Weak Arithmetics

Theoretical computer science, 2001, Vol.257 (1), p.1-15

Ressayre, J.-P.

2001

Link zum Volltext

Verfügbarkeit prüfen

Model Theory and Arithmetic: Comptes Rendus d'une Action Thematique Programmee du C. N. R. S. Sur la Theorie des Modeles et l'Arithmetique, Paris, France, 1979/80

1, 1981

Link zum Volltext

Verfügbarkeit prüfen

On infinite real trace rational languages of maximum topological complexity

Journal of mathematical sciences (New York, N.Y.), 2006-05, Vol.134 (5), p.2435-2444

2006

Link zum Volltext

Verfügbarkeit prüfen

Model Theory and Arithmetic: Comptes Rendus D'une Action Thématique Programmée du C.N.R.S. Sur la Théorie des Modèles et L'arithmétique, Paris, France, 1979/80

1981st edition, 2006

Link zum Volltext

Verfügbarkeit prüfen

Every real closed field has an integer part

The Journal of symbolic logic, 1993-06, Vol.58 (2), p.641-647

1993

Link zum Volltext

Verfügbarkeit prüfen

New Models of Bounded Induction Axioms

Journal of mathematical sciences (New York, N.Y.), 2005-10, Vol.130 (2), p.4574-4577

2005

Link zum Volltext

Verfügbarkeit prüfen

Stretchings

The Journal of symbolic logic, 1996-06, Vol.61 (2), p.563-585

1996

Link zum Volltext

Verfügbarkeit prüfen

Formal languages defined by the underlying structure of their words

The Journal of symbolic logic, 1988-12, Vol.53 (4), p.1009-1026

Ressayre, J. P.

1988

Link zum Volltext

Verfügbarkeit prüfen

Polynomial time uniformization and non-standard methods

Annals of mathematics and artificial intelligence, 1996-01, Vol.16 (1), p.75-88

Ressayre, J. P.

1996

Link zum Volltext

Verfügbarkeit prüfen

Boolean models and infinitary first order languages

Annals of mathematical logic, 1973-09, Vol.6 (1), p.41-92

Ressayre, J.-P.

1973

Link zum Volltext

Verfügbarkeit prüfen

Formal languages defined by the underlying structure of their words

The Journal of symbolic logic, 1988-12, Vol.53 (4), p.1009-1026

Ressayre, J. P.

1988

Link zum Volltext

Verfügbarkeit prüfen

Winning strategies for infinite games: from large cardinals to computer science extended abstract

Theoretical computer science, 2004-08, Vol.322 (1), p.175-179

Ressayre, Jean-Pierre

2004

Link zum Volltext

Verfügbarkeit prüfen

Models with compactness properties relative to an admissible language

Annals of mathematical logic, 1977-05, Vol.11 (1), p.31-55

Ressayre, J.P.

1977

Link zum Volltext

Verfügbarkeit prüfen

A transfinite version of Puiseux's theorem, with applications to real closed fields

Logic Colloquium '90, 2017, Vol.Series Number 2, p.250-258

2017

Link zum Volltext

Verfügbarkeit prüfen

Π 2 1 -Logic and uniformization in the analytical hierarchy

Archive for mathematical logic, 1989-06, Vol.28 (2), p.99-117

Ressayre, J. P.

1989

Link zum Volltext

Verfügbarkeit prüfen

PI 1/2 - Logic and Uniformization in the Analytical Hierarchy

Archive for mathematical logic, 1989-01, Vol.28 (2), p.99

Ressayre, J P

1989

Link zum Volltext

Verfügbarkeit prüfen

Jon Barwise and John Schlipf. On recursively saturated models of arithmetic. Model theory and algebra, A memorial tribute to Abraham Robinson, edited by D. H. Saracino and V. B. Weispfenning, Lecture notes in mathematics, vol. 498, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 42–55. - Patrick Cegielski, Kenneth McAloon, and George Wilmers. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels. Logic Colloquium '80, Papers intended for the Europe

The Journal of symbolic logic, 1987-03, Vol.52 (1), p.279-284

Ressayre, J.-P.

1987

Link zum Volltext

Verfügbarkeit prüfen

Independent Statements about Finite Stretchable Structures

Proceedings of the American Mathematical Society, 1988-10, Vol.104 (2), p.603-610

1988

Link zum Volltext

Verfügbarkeit prüfen

Review: Jon Barwise, John Schlipf, D. H. Saracino, V. B. Weispfenning, Model Theory and Algebra

The Journal of symbolic logic, 1987, Vol.52 (iss. 1), p.279-284

Ressayre, J.-P

1987

Link zum Volltext

Verfügbarkeit prüfen

Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9(1976), pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 (1976), pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 (1976), pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 (1976), vol. 43 (1

The Journal of symbolic logic, 1983-06, Vol.48 (2), p.484-485

Ressayre, J. P.

1983

Link zum Volltext

Verfügbarkeit prüfen

Omnibus Review

The Journal of symbolic logic, 1983, Vol.48 (iss. 2), p.484-485

Ressayre, J. P

1983

Link zum Volltext

Verfügbarkeit prüfen

Sur les théories du premier ordre catégoriques en un cardinal

Transactions of the American Mathematical Society, 1969-01, Vol.142, p.481-505

Ressayre, J. P.

1969

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

Model Theory and Arithmetic: Comptes Rendus d'une Action Thématique Programmée du C.N.R.S. sur la Théorie des Modèles et l'Arithmétique, Paris, France, 1979/80

Bootstrapping, part I

Computer science and the fine structure of Borel sets

Weak Arithmetics

Model Theory and Arithmetic: Comptes Rendus d'une Action Thematique Programmee du C. N. R. S. Sur la Theorie des Modeles et l'Arithmetique, Paris, France, 1979/80

On infinite real trace rational languages of maximum topological complexity

Model Theory and Arithmetic: Comptes Rendus D'une Action Thématique Programmée du C.N.R.S. Sur la Théorie des Modèles et L'arithmétique, Paris, France, 1979/80

Every real closed field has an integer part

New Models of Bounded Induction Axioms

Stretchings

Formal languages defined by the underlying structure of their words

Polynomial time uniformization and non-standard methods

Boolean models and infinitary first order languages

Formal languages defined by the underlying structure of their words

Winning strategies for infinite games: from large cardinals to computer science extended abstract

Models with compactness properties relative to an admissible language

A transfinite version of Puiseux's theorem, with applications to real closed fields

Π 2 1 -Logic and uniformization in the analytical hierarchy

PI 1/2 - Logic and Uniformization in the Analytical Hierarchy

Independent Statements about Finite Stretchable Structures

Review: Jon Barwise, John Schlipf, D. H. Saracino, V. B. Weispfenning, Model Theory and Algebra

Omnibus Review

Sur les théories du premier ordre catégoriques en un cardinal

Suchergebnisse filtern