Computation and Proof Theory :
Type de document | Site actuel | Cote | Statut | Date de retour prévue | Code à barres | Réservations |
---|---|---|---|---|---|---|
Livre | La bibliothèque des Sciences Exactes et Naturelles | 511.3 RIC (Parcourir l'étagère) | Disponible | 0000000027360 |
Contiguous R.E. Degrees -- Abstract construction of counterexamples in recursive graph theory -- Minimal degrees and 1-generic sets below 0? -- Undecidability and recursive equivalence II -- Logical syntax and computational complexity -- Subrecursive hierarchies via direct limits -- A star-finite relational semantics for parallel programs -- Between constructive and classical mathematics -- Partial closures and semantics of while: Towards an iteration-based theory of data types -- Toward logic tailored for computational complexity -- On a new notion of partial conservativity -- Finitely approximable sets -- A unified approach to constructive and recursive analysis -- On faithful interpretability -- Abstract recursion as a foundation for the theory of algorithms -- Some logical problems connected with a modular decomposition theory of automata -- Diophantine equations in a fragment of number theory -- Generalized rules for quantifiers and the completeness of the intuitionistic operators &,?,?,?,?,? -- On subsets of the Skolem class of exponential polynomials -- Effective operators in a topological setting -- An axiomatization of the apartness fragment of the theory DLO+ of dense linear order.
Il n'y a pas de commentaire pour ce document.