Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983
Springer Berlin (Verlag)
978-3-540-13901-0 (ISBN)
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.
| Erscheint lt. Verlag | 1.12.1984 |
|---|---|
| Reihe/Serie | Lecture Notes in Mathematics |
| Zusatzinfo | X, 482 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 680 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| Schlagworte | Computation • Equation • Equivalence • Finite • Mathematics • Mathematische Logik /Bericht • Proof • Proof theory • Recursion |
| ISBN-10 | 3-540-13901-X / 354013901X |
| ISBN-13 | 978-3-540-13901-0 / 9783540139010 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
