LEADER 01800nam 22004453 450 001 9910156441403321 005 20250827080354.0 010 $a1-78720-039-6 035 $a(CKB)3710000000986224 035 $a(BIP)056632512 035 $a(MiAaPQ)EBC32211167 035 $a(Au-PeEL)EBL32211167 035 $a(Exl-AI)993710000000986224 035 $a(OCoLC)1534805401 035 $a(EXLCZ)993710000000986224 100 $a20250827d2016 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aHoudini 205 $a1st ed. 210 1$aWaipu :$cPickle Partners Publishing,$d2016. 210 4$d©2016. 215 $a1 online resource (312 p.) 330 8 $aNo Magician has captured the imagination of the World as did Harry Houdini, his very name become a byword for stunning, amazing escapes.In this authoritative biography, acclaimed author and noted psychic sceptic, William Lindsay Gresham details the life of the great man. The strands of Houdini's life are chronicled in rich detail; the stage illusions and their invention, his private life as he travelled the world and Houdini's passion for exposing the frauds and scams of the 'psychic' world. Houdini's legendary illusions are explained and give a fascinating insight into their construction, created with simplicity that is the essence of true genius. 517 $aHoudini 606 $aMagicians$7Generated by AI 606 $aEscapes$7Generated by AI 615 0$aMagicians 615 0$aEscapes 700 $aGresham$b William Lindsay$01434410 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910156441403321 996 $aHoudini$94425876 997 $aUNINA LEADER 06197nam 22007935 450 001 9910767550503321 005 20251116234100.0 010 $a3-540-44622-2 024 7 $a10.1007/3-540-44622-2 035 $a(CKB)1000000000211277 035 $a(SSID)ssj0000322119 035 $a(PQKBManifestationID)11937852 035 $a(PQKBTitleCode)TC0000322119 035 $a(PQKBWorkID)10281436 035 $a(PQKB)11544723 035 $a(DE-He213)978-3-540-44622-4 035 $a(MiAaPQ)EBC3071790 035 $a(PPN)155234102 035 $a(BIP)13627129 035 $a(BIP)6756233 035 $a(EXLCZ)991000000000211277 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic $e14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings /$fedited by Peter G. Clote, Helmut Schwichtenberg 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XIV, 550 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1862 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67895-6 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Background, Reserve, and Gandy Machines -- Choiceless Polynomial Time Computation and the Zero-One Law -- Composition and Submachine Concepts for Sequential ASMs -- Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs -- Translating Theory into Practice ? Abstract State Machines within Microsoft -- Choiceless Polynomial Time Logic: Inability to Express -- Schema Revisited -- Automated Verification = Graphs, Automata, and Logic -- Contributed Papers -- A Fully Complete PER Model for ML Polymorphic Types -- Subtyping with Power Types -- The Descriptive Complexity of the Fixed-Points of Bounded Formulas -- Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic -- Continuous Functionals of Dependent Types and Equilogical Spaces -- Definability over Linear Constraints -- Bounded Arithmetic and Descriptive Complexity -- Independence: Logics and Concurrency -- Flatness Is Not a Weakness -- Sequents, Frames, and Completeness -- Disjunctive Tautologies as Synchronisation Schemes -- Axiomatizing the Least Fixed Point Operation and Binary Supremum -- Interactive Programs in Dependent Type Theory -- Modal Satisfiability Is in Deterministic Linear Space -- Logic Programming and Co-inductive Definitions -- A Theory of Explicit Mathematics Equivalent to ID 1 -- On the Complexity of Explicit Modal Logics -- Finite Models and Full Completeness -- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale -- Elimination of Negation in a Logical Framework -- Discreet Games, Light Affine Logic and PTIME Computation -- Completeness of Higher-Order Duration Calculus -- Equational Termination by Semantic Labelling -- On the Computational Interpretation of Negation -- From Programs to Games: Invariance and Safety for Bisimulation -- Logical Relations and Data Abstraction -- Elementary Choiceless Constructive Analysis -- On the Logic of the Standard Proof Predicate. 330 $aThis book constitutes the refereed proceedings of the 13th International Workshop on Computer Science Logic, CSL 2000, held in Fischbachau, Germany as the 8th Annual Conference of the EACSL in August 2000. The 28 revised full papers presented together with eight invited papers were carefully reviewed and selected by the program committee. Among the topics covered are automated deduction, theorem proving, categorical logic, term rewriting, finite model theory, higher order logic, lambda and combinatory calculi, computational complexity, logic programing, constraints, linear logic, modal logic, temporal logic, model checking, formal specification, formal verification, program transformation, etc. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1862 606 $aArtificial intelligence 606 $aProgramming languages (Electronic computers) 606 $aComputer architecture 606 $aLogic, Symbolic and mathematical 606 $aComputer logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aArtificial intelligence. 615 0$aProgramming languages (Electronic computers) 615 0$aComputer architecture. 615 0$aLogic, Symbolic and mathematical. 615 0$aComputer logic. 615 14$aArtificial Intelligence. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aComputer System Implementation. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Foundations. 676 $a004/.01/5113 702 $aClote$b Peter G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchwichtenberg$b Helmut$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic.$bConference$d(9th :$f2000 :$eFischbachau, Germany), 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a9910767550503321 996 $aComputer Science Logic$9771972 997 $aUNINA