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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
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. Artikel-Nr. 1803281
Anzahl: 1 verfügbar
Anbieter: Ammareal, Morangis, Frankreich
Softcover. Zustand: Très bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Petite(s) trace(s) de pliure sur la couverture. Salissures sur la tranche. Couverture différente. Edition 1980. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations car ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Signs of wear on the cover. Slightly creased cover. Stains on the edge. Different cover. Edition 1980. Ammareal gives back up to 15% of this item's net price to charity organizations. Artikel-Nr. E-573-650
Anzahl: 1 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Softcover. 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. Artikel-Nr. 2490641
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9783540139010_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
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. Artikel-Nr. 9783540139010
Anzahl: 1 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 488 | Sprache: Englisch | Produktart: Bücher | 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. Artikel-Nr. 4412969/202
Anzahl: 1 verfügbar