Zobrazeno 1 - 10 of 17 pro vyhledávání: '"Shaughan Lavine"'
1
Elektronická kniha
Understanding the Infinite
Autor: Shaughan Lavine
How can the infinite, a subject so remote from our finite experience, be an everyday tool for the working mathematician? Blending history, philosophy, mathematics, and logic, Shaughan Lavine answers this question with exceptional clarity. Making use
Zobrazit plný text záznamu
2
Second- and higher-order logics
Autor: Shaughan Lavine
In first-order predicate logic there are symbols for fixed individuals, relations and functions on a given universe of individuals and there are variables ranging over the individuals, with associated quantifiers. Second-order logic adds variables ra
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c70d431d4774695acd4b74b68f86e0ec
https://doi.org/10.4324/9780415249126-y044-1
Zobrazit plný text záznamu
4
[Untitled]
Autor: Shaughan Lavine
Publikováno v: Synthese. 124:1-43
Quineans have taken the basic expression of ontological commitment to be an assertion of the form '∃ x φ', assimilated to theEnglish 'there is something that is a φ'. Here I take the existential quantifier to be introduced, not as an abbreviation
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c0cc7dd1f29329c1283ea054f705a285
https://doi.org/10.1023/a:1005257423415
Zobrazit plný text záznamu
7
Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets
Autor: Shaughan Lavine
Publikováno v: Journal of Symbolic Logic. 58:81-98
Let be an admissible set. A sentence of the form is a sentence if φ ∈ (φ is ∨ Φ where Φ is an -r.e. set of sentences from ). A sentence of the form is an , sentence if φ is a sentence. A class of structures is, for example, a ∀1 class if i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0d8dc6318127998ac3b822699fd7ac29
https://doi.org/10.2307/2275326
Zobrazit plný text záznamu
8
A Spector-Gandy theorem for cPCd() classes
Autor: Shaughan Lavine
Publikováno v: Journal of Symbolic Logic. 57:478-500
Let be an admissible structure. A cPCd() class is the class of all models of a sentence of the form , where is an -r.e. set of relation symbols and Φ is an -r.e. set of formulas of ℒ∞,ω that are in . The main theorem is a generalization of the
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c6f7b5b1ee27eae5abe914be461a1dcd
https://doi.org/10.2307/2275283
Zobrazit plný text záznamu
10
Dual easy uniformization and model-theoretic descriptive set theory
Autor: Shaughan Lavine
Publikováno v: Journal of Symbolic Logic. 56:1290-1316
It is well known that, in the terminology of Moschovakis, Descriptive set theory (1980), every adequate normed pointclass closed under ∀ω has an effective version of the generalized reduction property (GRP) called the easy uniformization property
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fca18a7744b6c6429dcc7b4b61e19a12
https://doi.org/10.2307/2275476
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje