000			03679nam a22004935i 4500
001			978-3-540-38856-2
003			DE-He213
005			20160624101941.0
007			cr nn 008mamaa
008			121227s1984 gw | s |||| 0|eng d
020			_a9783540388562 _9978-3-540-38856-2
024	7		_a10.1007/3-540-13331-3 _2doi
050		4	_aQA75.5-76.95
072		7	_aUYZG _2bicssc
072		7	_aCOM037000 _2bisacsh
082	0	4	_a004.0151 _223
245	1	0	_aLogic and Machines: Decision Problems and Complexity _h[electronic resource] : _bProceedings of the Symposium “Rekursive Kombinatorik” held from May 23 – 28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen / _cedited by E. Börger, G. Hasenjaeger, D. Rödding.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1984.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1984.
300			_aVI, 460 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v171
505	0		_aP-mitotic sets -- Equivalence relations, invariants, and normal forms, II -- Recurrence relations for the number of labeled structures on a finite set -- Recursively enumerable extensions of R1 by finite functions -- On the complement of one complexity class in another -- The length-problem -- On r.e. inseparability of CPO index sets -- Arithmetical degrees of index sets for complexity classes -- Rudimentary relations and Turing machines with linear alternation -- A critical-pair/completion algorithm for finitely generated ideals in rings -- Extensible algorithms -- Some reordering properties for inequality proof trees -- Modular decomposition of automata -- Modular machines, undecidability and incompleteness -- Universal Turing machines (UTM) and Jones-Matiyasevich-masking -- Complexity of loop-problems in normed networks -- On the solvability of the extended ?? ? ??? — Ackermann class with identity -- Reductions for the satisfiability with a simple interpretation of the predicate variable -- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems) -- Implicit definability of finite binary trees by sets of equations -- Spektralproblem and completeness of logical decision problems -- Reduction to NP-complete problems by interpretations -- Universal quantifiers and time complexity of random access machines -- Second order spectra -- On the argument complexity of multiply transitive Boolean functions -- The VLSI complexity of Boolean functions -- Fast parallel algorithms for finding all prime implicants for discrete functions -- Bounds for Hodes - Specker theorem -- Proving lower bounds on the monotone complexity of Boolean functions.
650		0	_aComputer science.
650		0	_aLogic, Symbolic and mathematical.
650	1	4	_aComputer Science.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aMathematical Logic and Foundations.
700	1		_aBörger, E. _eeditor.
700	1		_aHasenjaeger, G. _eeditor.
700	1		_aRödding, D. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540133315
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v171
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-13331-3
942			_2EBK4553 _cEBK
999			_c33847 _d33847