skip to main content
Lingue:

Risutati 1 - 10 di 27  per Ricerca globale

Risultati 1 2 3 next page
Mostra solo
Filtrati per: Titolo della rivista: Annals Of Pure And Applied Logic rimuovi
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Succinctness as a source of complexity in logical formalisms
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Succinctness as a source of complexity in logical formalisms

Gottlob, Georg ; Leone, Nicola ; Veith, Helmut

Annals of pure and applied logic, 1999, Vol.97 (1), p.231-260 [Rivista Peer Reviewed]

Fulltext disponibile

2
On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry

Hill, Cameron Donnay

Annals of pure and applied logic, 2016-11, Vol.167 (11), p.1093-1122 [Rivista Peer Reviewed]

Fulltext disponibile

3
Classical and effective descriptive complexities of ω -powers
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Classical and effective descriptive complexities of ω -powers

Finkel, Olivier ; Lecomte, Dominique

Annals of pure and applied logic, 2009, Vol.160 (2), p.163-191 [Rivista Peer Reviewed]

Fulltext disponibile

4
Descriptive complexity of graph spectra
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Descriptive complexity of graph spectra

Dawar, Anuj ; Severini, Simone ; Zapata, Octavio

Annals of pure and applied logic, 2019-09, Vol.170 (9), p.993-1007 [Rivista Peer Reviewed]

Fulltext disponibile

5
Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic

Addison, J.W

Annals of pure and applied logic, 2004, Vol.126 (1), p.77-92 [Rivista Peer Reviewed]

Fulltext disponibile

6
Classical and effective descriptive complexities of I -powers
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Classical and effective descriptive complexities of I -powers

Finkel, Olivier ; Lecomte, Dominique

Annals of pure and applied logic, 2009-08-01, Vol.160 (2), p.163 [Rivista Peer Reviewed]

Fulltext disponibile

7
The descriptive set-theoretical complexity of the embeddability relation on models of large size
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

The descriptive set-theoretical complexity of the embeddability relation on models of large size

Motto Ros, Luca

Annals of pure and applied logic, 2013-12, Vol.164 (12), p.1454-1492 [Rivista Peer Reviewed]

Fulltext disponibile

8
Classical and Effective Descriptive Complexities of omega-Powers
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Classical and Effective Descriptive Complexities of omega-Powers

Finkel, Olivier ; Lecomte, Dominique

Annals of pure and applied logic, 2009, Vol.160 (2), p.163-191 [Rivista Peer Reviewed]

Fulltext disponibile

9
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs

Dawar, Anuj ; Richerby, David ; Rossman, Benjamin

Annals of pure and applied logic, 2008, Vol.152 (1), p.31-50 [Rivista Peer Reviewed]

Fulltext disponibile

10
An existential locality theorem
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

An existential locality theorem

Grohe, Martin ; Wöhrle, Stefan

Annals of pure and applied logic, 2004, Vol.129 (1), p.131-148 [Rivista Peer Reviewed]

Fulltext disponibile

Risutati 1 - 10 di 27  per Ricerca globale

Risultati 1 2 3 next page

Ricerca in corso nelle risorse remote ...