LEADER 05122nam  22008535  450 
001 996465841803316
005 20210629170400.0
010   $a3-642-03092-0
024 7 $a10.1007/978-3-642-03092-5
035   $a(CKB)1000000000798304
035   $a(SSID)ssj0000318235
035   $a(PQKBManifestationID)11283545
035   $a(PQKBTitleCode)TC0000318235
035   $a(PQKBWorkID)10308724
035   $a(PQKB)11193449
035   $a(DE-He213)978-3-642-03092-5
035   $a(MiAaPQ)EBC3064706
035   $a(PPN)139958320
035   $a(EXLCZ)991000000000798304
100   $a20100301d2009      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aInfinity in Logic and Computation$b[electronic resource] $eInternational Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers /$fedited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe
205   $a1st ed. 2009.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009.
215   $a1 online resource (XIII, 139 p.)
225 1 $aLecture Notes in Artificial Intelligence ;$v5489
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-03091-2 
320   $aIncludes bibliographical references and index.
327   $aNadia Busi (1968?2007) -- Symbolic Model Checking of Tense Logics on Rational Kripke Models -- Genetic Systems without Inhibition Rules -- Probabilistic Systems with LimSup and LimInf Objectives -- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata -- Towards Model-Checking Programs with Lists -- Representations of Numbers as :A Saddle Point Approach -- Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata -- Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions -- Is P?=?PSPACE for Infinite Time Turing Machines?.
330   $aEdited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume constitutes a selection of papers presented at the International Conference on Infinity in Logic and Computation, ILC 2007, held in Cape Town, South Africa, in November 2007. The 7 revised papers presented together with 2 invited talks were carefully selected from 27 initial submissions during two rounds of reviewing and improvement. The papers address all aspects of infinity in automata theory, logic, computability and verification and focus on topics such as automata on infinite objects; combinatorics, cryptography and complexity; computability and complexity on the real numbers; infinite games and their connections to logic; logic, computability, and complexity in finitely presentable infinite structures; randomness and computability; transfinite computation; and verification of infinite state systems.
410  0$aLecture Notes in Artificial Intelligence ;$v5489
606   $aArtificial intelligence
606   $aComputer programming
606   $aProgramming languages (Electronic computers)
606   $aComputers
606   $aAlgorithms
606   $aMathematical logic
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
608   $aCape Town (2007)$2swd
608   $aKongress.$2swd
615  0$aArtificial intelligence.
615  0$aComputer programming.
615  0$aProgramming languages (Electronic computers).
615  0$aComputers.
615  0$aAlgorithms.
615  0$aMathematical logic.
615 14$aArtificial Intelligence.
615 24$aProgramming Techniques.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aTheory of Computation.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aMathematical Logic and Formal Languages.
676   $a004n/a
686   $a004$2sdnb
686   $aDAT 500f$2stub
686   $aSS 4800$2rvk
702   $aArchibald$b Margaret$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aBrattka$b Vasco$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aGoranko$b Valentin F$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aLöwe$b Benedikt$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465841803316
996   $aInfinity in Logic and Computation$9774249
997   $aUNISA