Computation and Proof Theory : Proceedings of the Logic Colloquium held in Aachen, July 18 23, 1983 Part II
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , , , , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in mathematics
1104 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL Accès INSA CVL |
| Nota: |
Autres contributions : Brigitta Schinzel, Wolfgang Thomas (eds) Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computation and proof theory, proceedings of the Logic Colloquium held in Aachen, July 18-23, 1983, part II, edited by M.M. Richter, E. Börger, W. Oberschelp... [et al.], 1984, Berlin [etc.], Springer-Verlag, 1 vol. (VII-475 p.), Lecture notes in mathematics, 3-540-13901-X • Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983, Texte imprimé, 9783662205327 |
Sommario:
- 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.