Proofs and algorithms: an introduction to logic and computability

Gespeichert in:

Personen und Körperschaften:	Dowek, Gilles (VerfasserIn)
Titel:	Proofs and algorithms: an introduction to logic and computability/ Gilles Dowek
Originaltitel:	Les démonstrations et les algorithmes <engl.>
Format:	Buch
Sprache:	Englisch, Französisch
veröffentlicht:	London, Heidelberg [u.a.] Springer 2011
Gesamtaufnahme:	Undergraduate topics in computer science
Schlagwörter:	Logic, Symbolic and mathematical Algorithms Computer logic Lehrbuch
Online-Ausg.:	Dowek, Gilles, 1966 - , Proofs and Algorithms, London : Springer London, 2011, Online-Ressource (VIII, 195p, digital)
Quelle:	Verbunddaten SWB
Anmerkungen:	Aus dem Franz. übers.


LEADER	07052cam a2201309 4500
001	0-634764896
003	DE-627
005	20220708134856.0
007	tu
008	100908s2011 xxk\|\|\|\|\| 00\| \|\|eng c
010			\|a 2011282450
015			\|a 10,N36 \|2 dnb
016	7		\|a 015659649 \|2 UK
016	7		\|a 1006409246 \|2 DE-101
020			\|a 9780857291202 \|c PB. : ca. EUR 37.40 (freier Pr.), ca. sfr 50.50 (freier Pr.) \|9 978-0-85729-120-2
020			\|a 0857291203 \|c (pbk.) £26.99 \|9 0-85729-120-3
024	3		\|a 9780857291202
028	5	2	\|a 12833764
035			\|a (DE-627)634764896
035			\|a (DE-576)333024737
035			\|a (DE-599)DNB1006409246
035			\|a (OCoLC)845951922
035			\|a (OCoLC)700433383
035			\|a (DE-101)1006409246
035			\|a (ZBM)1230.03001
035			\|a (ZBM)1230.03001
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng \|h fre
044			\|c XA-GB \|c XA-NL \|c XA-DE
050		0	\|a QA9
082	0		\|a 004.015113 \|q LOC \|2 22
082	0	4	\|a 510 \|q DNB
084			\|a SK 130 \|q BVB \|2 rvk \|0 (DE-625)rvk/143216:
084			\|a ST 134 \|2 rvk \|0 (DE-625)rvk/143590:
084			\|a *03-01 \|2 MSC
084			\|a 68-01 \|2 MSC
084			\|a 03B10 \|2 MSC
084			\|a 03B25 \|2 MSC
084			\|a 03B35 \|2 MSC
084			\|a 03B40 \|2 MSC
084			\|a 03B70 \|2 MSC
084			\|a 03C07 \|2 MSC
084			\|a 03D10 \|2 MSC
084			\|a 03D20 \|2 MSC
084			\|a 03D35 \|2 MSC
084			\|a 03F03 \|2 MSC
084			\|a 68Q05 \|2 MSC
084			\|a 68W01 \|2 MSC
084			\|a 31.10 \|2 bkl
084			\|a 54.10 \|2 bkl
090			\|a a
100	1		\|a Dowek, Gilles \|d 1966- \|0 (DE-588)11433191X \|0 (DE-627)661837262 \|0 (DE-576)345428110 \|4 aut
240	1	0	\|a Les démonstrations et les algorithmes <engl.>
245	1	0	\|a Proofs and algorithms: an introduction to logic and computability \|c Gilles Dowek
264		1	\|a London \|a Heidelberg [u.a.] \|b Springer \|c 2011
300			\|a XII, 155 S. \|b graph. Darst. \|c 235 mm x 155 mm
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
490	0		\|a Undergraduate topics in computer science
500			\|a Franz. Ausg. u.d.T.: Dowek, Gilles: Les démonstrations et les algorithmes
505	8	0	\|a Part. 1. Proofs:1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue.
505	8	0	\|a Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue.
546			\|a Aus dem Franz. übers.
583	1		\|a Archivierung/Langzeitarchivierung gewährleistet \|f PEBW \|h DE-31 \|2 pdager \|5 DE-180
650		0	\|a Logic, Symbolic and mathematical
650		0	\|a Algorithms
653		4	\|a Computer logic
655		7	\|a Lehrbuch \|0 (DE-588)4123623-3 \|0 (DE-627)104270187 \|0 (DE-576)209561262 \|2 gnd-content
689	0	0	\|D s \|0 (DE-588)4037951-6 \|0 (DE-627)104707992 \|0 (DE-576)20902741X \|a Mathematische Logik \|2 gnd
689	0	1	\|D s \|0 (DE-588)4138368-0 \|0 (DE-627)105643211 \|0 (DE-576)209685441 \|a Berechenbarkeit \|2 gnd
689	0	2	\|D s \|0 (DE-588)4200409-3 \|0 (DE-627)105173924 \|0 (DE-576)210135271 \|a Algorithmentheorie \|2 gnd
689	0		\|5 (DE-627)
700	1	2	\|a Dowek, Gilles \|d 1966- \|t Les démonstrations et les algorithmes <engl.>
776	1		\|z 9780857291219
776	0	8	\|i Online-Ausg. \|a Dowek, Gilles, 1966 - \|t Proofs and Algorithms \|d London : Springer London, 2011 \|h Online-Ressource (VIII, 195p, digital) \|w (DE-627)1650768125 \|w (DE-576)337805296 \|z 9780857291219
856	4	2	\|u http://www.gbv.de/dms/tib-ub-hannover/634764896.pdf \|m V:DE-601 \|m B:DE-89 \|q pdf/application \|v 2012-03-06 \|x Verlag \|y Inhaltsverzeichnis \|3 Inhaltsverzeichnis
856	4	2	\|u http://www.loc.gov/catdir/enhancements/fy1113/2011282450-b.html \|x Verlag \|3 Autorenbiografie
856	4	2	\|u http://www.loc.gov/catdir/enhancements/fy1113/2011282450-d.html \|x Verlag \|3 Verlagsangaben
856	4	2	\|u http://deposit.d-nb.de/cgi-bin/dokserv?id=3530362&prov=M&dok_var=1&dok_ext=htm \|m X:MVB \|q text/html \|x Verlag \|3 Inhaltstext
856	4	2	\|u https://zbmath.org/?q=an:1230.03001 \|m B:ZBM \|v 2021-04-12 \|x Verlag \|y Zentralblatt MATH \|3 Inhaltstext
935			\|i sf
935			\|i Blocktest
936	r	v	\|a SK 130 \|b Logik und Grundlagen, Metamathematik, \|k Monografien \|k Logik und Grundlagen, Metamathematik, \|0 (DE-627)1270918567 \|0 (DE-625)rvk/143216: \|0 (DE-576)200918567
936	r	v	\|a ST 134 \|b Algorithmen-, Komplexitätstheorie \|k Monografien \|k Grundlagen der Informatik \|k Theoretische Informatik \|k Algorithmen-, Komplexitätstheorie \|0 (DE-627)1272612511 \|0 (DE-625)rvk/143590: \|0 (DE-576)202612511
936	b	k	\|a 31.10 \|j Mathematische Logik \|j Mengenlehre \|0 (DE-627)10640847X
936	b	k	\|a 54.10 \|j Theoretische Informatik \|0 (DE-627)106418815
951			\|a BO
020			\|z 0857291211
983			\|a (DE-14)14811115
984			\|c B
852			\|a DE-14 \|z 2011-02-08T15:45:39Z \|x 2020-12-21
983			\|a (DE-Zwi2)500159389
975			\|c B
852			\|a DE-Zwi2 \|z 2011-04-12T14:07:45Z \|x 2020-12-23
975			\|o 82 433
900			\|a Dowek, G.
950			\|a Rekursionstheorie
950			\|a Berechnungstheorie
950			\|a Logik
950			\|a Algebra der Logik
950			\|a Algebraische Logik
950			\|a Formale Logik
950			\|a Logistik
950			\|a Symbolische Logik
950			\|a Mathematik
950			\|a 数理逻辑
950			\|a 數理邏輯
950			\|a Математическая логика
950			\|a Algorithmus
951			\|b XA-FR
980			\|a 634764896 \|b 0 \|k 634764896 \|o 333024737 \|u 2023-01-20

openURL	url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Proofs+and+algorithms%3A+an+introduction+to+logic+and+computability&rft.date=2011&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Proofs+and+algorithms%3A+an+introduction+to+logic+and+computability&rft.series=Undergraduate+topics+in+computer+science&rft.au=Dowek%2C+Gilles&rft.pub=Springer&rft.edition=&rft.isbn=0857291203

openURL

url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Proofs+and+algorithms%3A+an+introduction+to+logic+and+computability&rft.date=2011&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Proofs+and+algorithms%3A+an+introduction+to+logic+and+computability&rft.series=Undergraduate+topics+in+computer+science&rft.au=Dowek%2C+Gilles&rft.pub=Springer&rft.edition=&rft.isbn=0857291203

SOLR
_version_	1755521335884251136
access_facet	Local Holdings
author	Dowek, Gilles
author2	Dowek, Gilles
author2_role
author2_variant	g d gd
author_facet	Dowek, Gilles, Dowek, Gilles
author_role	aut
author_sort	Dowek, Gilles 1966-
author_variant	g d gd
barcode	(DE-14)32992759
barcode_dezwi2	00346809
branch_de14	zell9
branch_dezwi2	Hauptbibliothek
building	(DE-14)zell9
callnumber-first	Q - Science
callnumber-label	QA9
callnumber-raw	QA9, a
callnumber-search	QA9, a
callnumber-sort	QA 19
callnumber-subject	QA - Mathematics
callnumber_dezwi2	ST 134 D746, 82 433 ST 134 D746
collcode_dezwi2	Freihand
contents	Part. 1. Proofs:1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue., Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue.
ctrlnum	(DE-627)634764896, (DE-576)333024737, (DE-599)DNB1006409246, (OCoLC)845951922, (OCoLC)700433383, (DE-101)1006409246, (ZBM)1230.03001
dewey-full	004.015113, 510
dewey-hundreds	000 - Computer science, information & general works, 500 - Science
dewey-ones	004 - Data processing & computer science, 510 - Mathematics
dewey-raw	004.015113, 510
dewey-search	004.015113, 510
dewey-sort	14.015113
dewey-tens	000 - Computer science, knowledge & systems, 510 - Mathematics
facet_avail	Local
facet_de14_branch_collcode_exception	zell9_MAG_NM
facet_local_del330	Mathematische Logik, Berechenbarkeit, Algorithmentheorie
facet_topic_nrw_music	Computer logic
finc_class_facet	Mathematik, Informatik
finc_id_str	0001089616
fincclass_txtF_mv	science-mathematics, science-computerscience
footnote	Franz. Ausg. u.d.T.: Dowek, Gilles: Les démonstrations et les algorithmes
format	Book
format_access_txtF_mv	Book, E-Book
format_de14	Book, E-Book
format_de15	Book, E-Book
format_del152	Buch
format_detail_txtF_mv	text-print-monograph-independent
format_dezi4	e-Book
format_dezwi2	Book
format_finc	Book, E-Book
format_legacy	Book
format_legacy_nrw	Book, E-Book
format_nrw	Book, E-Book
format_strict_txtF_mv	Book
genre	Lehrbuch (DE-588)4123623-3 (DE-627)104270187 (DE-576)209561262 gnd-content
genre_facet	Lehrbuch
geogr_code	not assigned
geogr_code_person	France
id	0-634764896
illustrated	Not Illustrated
imprint	London, Heidelberg [u.a.], Springer, 2011
imprint_str_mv	London; Heidelberg [u.a.]: Springer, 2011
institution	DE-14, DE-Zwi2
is_hierarchy_id
is_hierarchy_title
isbn	9780857291202, 0857291203
isbn_isn_mv	9780857291219, 0857291211
isil_str_mv	DE-14, DE-Zwi2
kxp_id_str	634764896
language	English, French
last_indexed	2023-01-20T06:20:07.946Z
lccn	2011282450
local_heading_facet_dezwi2	Logic, Symbolic and mathematical, Algorithms, Mathematische Logik, Berechenbarkeit, Algorithmentheorie
marc024a_ct_mv	9780857291202
marc028a_ct_mv	12833764
match_str	dowek2011proofsandalgorithmsanintroductiontologicandcomputability
mega_collection	Verbunddaten SWB
names_id_str_mv	(DE-588)11433191X, (DE-627)661837262, (DE-576)345428110
oclc_num	845951922, 700433383
physical	XII, 155 S.; graph. Darst; 235 mm x 155 mm
publishDate	2011
publishDateSort	2011
publishPlace	London
publisher	Springer
record_format	marcfinc
record_id	333024737
recordtype	marcfinc
rsn_id_str_mv	(DE-14)14811115
rvk_facet	SK 130, ST 134
rvk_label	Monografien, Logik und Grundlagen, Metamathematik,, Grundlagen der Informatik, Theoretische Informatik, Algorithmen-, Komplexitätstheorie
rvk_path	ST, SQ - SU, ST 134, SK 130, ST 120 - ST 140, SK, ST 130 - ST 140, SA - SP
rvk_path_str_mv	ST, SQ - SU, ST 134, SK 130, ST 120 - ST 140, SK, ST 130 - ST 140, SA - SP
series2	Undergraduate topics in computer science
signatur	(DE-14)R2017 8 2889, (DE-14)2011 8 005504, (DE-14)ST 134 D746
source_id	0
spelling	Dowek, Gilles 1966- (DE-588)11433191X (DE-627)661837262 (DE-576)345428110 aut, Les démonstrations et les algorithmes <engl.>, Proofs and algorithms: an introduction to logic and computability Gilles Dowek, London Heidelberg [u.a.] Springer 2011, XII, 155 S. graph. Darst. 235 mm x 155 mm, Text txt rdacontent, ohne Hilfsmittel zu benutzen n rdamedia, Band nc rdacarrier, Undergraduate topics in computer science, Franz. Ausg. u.d.T.: Dowek, Gilles: Les démonstrations et les algorithmes, Part. 1. Proofs:1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue., Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue., Aus dem Franz. übers., Archivierung/Langzeitarchivierung gewährleistet PEBW DE-31 pdager DE-180, Logic, Symbolic and mathematical, Algorithms, Computer logic, Lehrbuch (DE-588)4123623-3 (DE-627)104270187 (DE-576)209561262 gnd-content, s (DE-588)4037951-6 (DE-627)104707992 (DE-576)20902741X Mathematische Logik gnd, s (DE-588)4138368-0 (DE-627)105643211 (DE-576)209685441 Berechenbarkeit gnd, s (DE-588)4200409-3 (DE-627)105173924 (DE-576)210135271 Algorithmentheorie gnd, (DE-627), Dowek, Gilles 1966- Les démonstrations et les algorithmes <engl.>, 9780857291219, Online-Ausg. Dowek, Gilles, 1966 - Proofs and Algorithms London : Springer London, 2011 Online-Ressource (VIII, 195p, digital) (DE-627)1650768125 (DE-576)337805296 9780857291219, http://www.gbv.de/dms/tib-ub-hannover/634764896.pdf V:DE-601 B:DE-89 pdf/application 2012-03-06 Verlag Inhaltsverzeichnis Inhaltsverzeichnis, http://www.loc.gov/catdir/enhancements/fy1113/2011282450-b.html Verlag Autorenbiografie, http://www.loc.gov/catdir/enhancements/fy1113/2011282450-d.html Verlag Verlagsangaben, http://deposit.d-nb.de/cgi-bin/dokserv?id=3530362&prov=M&dok_var=1&dok_ext=htm X:MVB text/html Verlag Inhaltstext, https://zbmath.org/?q=an:1230.03001 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, DE-14 2011-02-08T15:45:39Z 2020-12-21, DE-Zwi2 2011-04-12T14:07:45Z 2020-12-23
spellingShingle	Dowek, Gilles, Proofs and algorithms: an introduction to logic and computability, Part. 1. Proofs:1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue., Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue., Logic, Symbolic and mathematical, Algorithms, Computer logic, Lehrbuch, Mathematische Logik, Berechenbarkeit, Algorithmentheorie
swb_id_str	333024737
title	Proofs and algorithms: an introduction to logic and computability
title_alt	Les démonstrations et les algorithmes <engl.>
title_auth	Proofs and algorithms: an introduction to logic and computability
title_full	Proofs and algorithms: an introduction to logic and computability Gilles Dowek
title_fullStr	Proofs and algorithms: an introduction to logic and computability Gilles Dowek
title_full_unstemmed	Proofs and algorithms: an introduction to logic and computability Gilles Dowek
title_short	Proofs and algorithms: an introduction to logic and computability
title_sort	proofs and algorithms an introduction to logic and computability
topic	Logic, Symbolic and mathematical, Algorithms, Computer logic, Lehrbuch, Mathematische Logik, Berechenbarkeit, Algorithmentheorie
topic_facet	Logic, Symbolic and mathematical, Algorithms, Lehrbuch, Mathematische Logik, Berechenbarkeit, Algorithmentheorie, Computer logic
url	http://www.gbv.de/dms/tib-ub-hannover/634764896.pdf, http://www.loc.gov/catdir/enhancements/fy1113/2011282450-b.html, http://www.loc.gov/catdir/enhancements/fy1113/2011282450-d.html, http://deposit.d-nb.de/cgi-bin/dokserv?id=3530362&prov=M&dok_var=1&dok_ext=htm, https://zbmath.org/?q=an:1230.03001