![The Syntax and Semantics of Infinitary Languages [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
The Syntax and Semantics of Infinitary Languages [electronic resource] /
Implicit definability and compactness in infinitary languages -- Some remarks on the model theory of infinitary languages -- Remarks on the theory of geometrical constructions -- Note on admissible ordinals -- An algebraic proof of the barwise compactness theorem -- Formulas with linearly ordered quantifiers -- Some problems in group theory -- Choice of infinitary languages by means of definability criteria; Generalized recursion theory -- Definability, automorphisms, and infinitary languages -- The hanf number for complete sentences -- Quantified algebras -- Normal derivability in classical logic -- A determinate logic -- (?1, ?) properties of unions of models.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1968
|
| Subjects: | Mathematics., Computer logic., Mathematical logic., Mathematical Logic and Foundations., Mathematics, general., Logics and Meanings of Programs., |
| Online Access: | http://dx.doi.org/10.1007/BFb0079679 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
KOHA-OAI-TEST:182040 |
|---|---|
| record_format |
koha |
| spelling |
KOHA-OAI-TEST:1820402018-07-30T23:02:55ZThe Syntax and Semantics of Infinitary Languages [electronic resource] / Barwise, Jon. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,1968.engImplicit definability and compactness in infinitary languages -- Some remarks on the model theory of infinitary languages -- Remarks on the theory of geometrical constructions -- Note on admissible ordinals -- An algebraic proof of the barwise compactness theorem -- Formulas with linearly ordered quantifiers -- Some problems in group theory -- Choice of infinitary languages by means of definability criteria; Generalized recursion theory -- Definability, automorphisms, and infinitary languages -- The hanf number for complete sentences -- Quantified algebras -- Normal derivability in classical logic -- A determinate logic -- (?1, ?) properties of unions of models.Mathematics.Computer logic.Mathematical logic.Mathematics.Mathematical Logic and Foundations.Mathematics, general.Logics and Meanings of Programs.Springer eBookshttp://dx.doi.org/10.1007/BFb0079679URN:ISBN:9783540359005 |
| institution |
COLPOS |
| collection |
Koha |
| country |
México |
| countrycode |
MX |
| component |
Bibliográfico |
| access |
En linea En linea |
| databasecode |
cat-colpos |
| tag |
biblioteca |
| region |
America del Norte |
| libraryname |
Departamento de documentación y biblioteca de COLPOS |
| language |
eng |
| topic |
Mathematics. Computer logic. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematics, general. Logics and Meanings of Programs. Mathematics. Computer logic. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematics, general. Logics and Meanings of Programs. |
| spellingShingle |
Mathematics. Computer logic. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematics, general. Logics and Meanings of Programs. Mathematics. Computer logic. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematics, general. Logics and Meanings of Programs. Barwise, Jon. editor. SpringerLink (Online service) The Syntax and Semantics of Infinitary Languages [electronic resource] / |
| description |
Implicit definability and compactness in infinitary languages -- Some remarks on the model theory of infinitary languages -- Remarks on the theory of geometrical constructions -- Note on admissible ordinals -- An algebraic proof of the barwise compactness theorem -- Formulas with linearly ordered quantifiers -- Some problems in group theory -- Choice of infinitary languages by means of definability criteria; Generalized recursion theory -- Definability, automorphisms, and infinitary languages -- The hanf number for complete sentences -- Quantified algebras -- Normal derivability in classical logic -- A determinate logic -- (?1, ?) properties of unions of models. |
| format |
Texto |
| topic_facet |
Mathematics. Computer logic. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematics, general. Logics and Meanings of Programs. |
| author |
Barwise, Jon. editor. SpringerLink (Online service) |
| author_facet |
Barwise, Jon. editor. SpringerLink (Online service) |
| author_sort |
Barwise, Jon. editor. |
| title |
The Syntax and Semantics of Infinitary Languages [electronic resource] / |
| title_short |
The Syntax and Semantics of Infinitary Languages [electronic resource] / |
| title_full |
The Syntax and Semantics of Infinitary Languages [electronic resource] / |
| title_fullStr |
The Syntax and Semantics of Infinitary Languages [electronic resource] / |
| title_full_unstemmed |
The Syntax and Semantics of Infinitary Languages [electronic resource] / |
| title_sort |
syntax and semantics of infinitary languages [electronic resource] / |
| publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, |
| publishDate |
1968 |
| url |
http://dx.doi.org/10.1007/BFb0079679 |
| work_keys_str_mv |
AT barwisejoneditor thesyntaxandsemanticsofinfinitarylanguageselectronicresource AT springerlinkonlineservice thesyntaxandsemanticsofinfinitarylanguageselectronicresource AT barwisejoneditor syntaxandsemanticsofinfinitarylanguageselectronicresource AT springerlinkonlineservice syntaxandsemanticsofinfinitarylanguageselectronicresource |
| _version_ |
1756264905891119104 |