Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983
Part 2: Computation and Proof Theory
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
48.10 €
Produktdetails
Produktinformationen zu „Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983 “
Klappentext zu „Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983 “
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.
Inhaltsverzeichnis zu „Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983 “
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.
Bibliographische Angaben
- 1984, 488 Seiten, Maße: 15,5 x 23,5 cm, Taschenbuch, Englisch
- Herausgegeben: M. M. Richter, E. Börger, W. Thomas, B. Schinzel, W. Oberschelp
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 354013901X
- ISBN-13: 9783540139010
- Erscheinungsdatum: 01.12.1984
Sprache:
Englisch
Kommentar zu "Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983"
0 Gebrauchte Artikel zu „Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983".
Kommentar verfassen