Isbn: 9783540139010 - proceedings of the logic colloquium. held in aachen, july 18-23, 1983: part 2: computation and proof theory (lecture notes in mathematics, 1104, band 1104) (11 Ergebnisse)

Broschiert. Zustand: Gut. 475 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Einbandkanten sind leicht bestoßen. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 790.…

Softcover. Zustand: Gut. 1984 edition. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04407 354013901X Sprache: Englisch Gewicht in Gramm: 1150.

Zustand: New. In.

Zustand: New. pp. 488.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Paperback. Zustand: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 488 pp. Englisch.…

Zustand: New. Print on Demand pp. 488 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Zustand: New. PRINT ON DEMAND pp. 488.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. …

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 488 pp. Englisch.…