LEADER 02896nam 2200649Ia 450 001 9910451448703321 005 20200520144314.0 010 $a1-135-89679-8 010 $a1-281-31371-8 010 $a9786611313715 010 $a0-203-92933-0 035 $a(CKB)1000000000415066 035 $a(EBL)333168 035 $a(OCoLC)476137959 035 $a(SSID)ssj0000128971 035 $a(PQKBManifestationID)11131813 035 $a(PQKBTitleCode)TC0000128971 035 $a(PQKBWorkID)10070726 035 $a(PQKB)10071740 035 $a(MiAaPQ)EBC333168 035 $a(Au-PeEL)EBL333168 035 $a(CaPaEBR)ebr10228484 035 $a(CaONFJC)MIL131371 035 $a(EXLCZ)991000000000415066 100 $a20070918d2008 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aConsciousness and the existence of God$b[electronic resource] $ea theistic argument /$fJ.P. Moreland 210 $aNew York $cRoutledge$d2008 215 $a1 online resource (255 p.) 225 1 $aRoutledge studies in the philosophy of religion ;$v4 300 $aDescription based upon print version of record. 311 $a0-415-98953-1 311 $a0-415-96240-4 320 $aIncludes bibliographical references and indexes. 327 $aBook Cover; Title; Copyright; Contents; Preface; 1 The epistemic backdrop for locating consciousness in a naturalist ontology; 2 The argument from consciousness; 3 John Searle and contingent correlation; 4 Timothy O'Connor and emergent necessitation; 5 Colin McGinn and mysterian "naturalism"; 6 David Skrbina and panpsychism; 7 Philip Clayton and pluralistic emergentist monism; 8 Science and strong physicalism; 9 AC, dualism and the fear of God; Notes; Bibliography; Author index; Subject index; 330 $aIn Consciousness and the Existence of God , JP Moreland argues that the existence of finite, irreducible consciousness (or its regular, law-like correlation with physical states) provides evidence for the existence of God. Considering Searle's contingent correlation, O'Connor's emergent necessitation, and Nagel's mysterian "naturalism," Moreland concludes that these versions of naturalism should be rejected in favor of what he calls  "the Argument from Consciousness." 410 0$aRoutledge studies in the philosophy of religion ;$v4. 606 $aConsciousness 606 $aNaturalism 606 $aTheism 608 $aElectronic books. 615 0$aConsciousness. 615 0$aNaturalism. 615 0$aTheism. 676 $a212/.1 700 $aMoreland$b James Porter$f1948-$0859521 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910451448703321 996 $aConsciousness and the existence of God$92018122 997 $aUNINA LEADER 05287nam 22007335 450 001 996465924403316 005 20230406055740.0 024 7 $a10.1007/11538363 035 $a(CKB)1000000000213183 035 $a(SSID)ssj0000316899 035 $a(PQKBManifestationID)11237046 035 $a(PQKBTitleCode)TC0000316899 035 $a(PQKBWorkID)10288390 035 $a(PQKB)11431523 035 $a(DE-He213)978-3-540-31897-2 035 $a(MiAaPQ)EBC3067782 035 $a(PPN)123096731 035 $a(EXLCZ)991000000000213183 100 $a20100928d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings /$fedited by Luke Ong 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XI, 567 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3634 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540282310 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- XML Navigation and Tarski?s Relation Algebras -- Verification in Predicate Logic with Time: Algorithmic Questions -- Note on Formal Analogical Reasoning in the Juridical Context -- An Abstract Strong Normalization Theorem -- Semantics and Logics -- On Bunched Polymorphism -- Distributed Control Flow with Classical Modal Logic -- A Logic of Coequations -- A Semantic Formulation of ???-Lifting and Logical Predicates for Computational Metalanguage -- Type Theory and Lambda Calculus -- Order Structures on Böhm-Like Models -- Higher-Order Matching and Games -- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations -- On the Role of Type Decorations in the Calculus of Inductive Constructions -- Linear Logic and Ludics -- L-Nets, Strategies and Proof-Nets -- Permutative Logic -- Focusing the Inverse Method for Linear Logic -- Towards a Typed Geometry of Interaction -- Constraints -- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction -- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints -- Finite Models, Decidability and Complexity -- Coprimality in Finite Models -- Towards a Characterization of Order-Invariant Queries over Tame Structures -- Decidability of Term Algebras Extending Partial Algebras -- Results on the Guarded Fragment with Equivalence or Transitive Relations -- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic -- On the Complexity of Hybrid Logics with Binders -- The Complexity of Independence-Friendly Fixpoint Logic -- Closure Properties of Weak Systems of Bounded Arithmetic -- Verification and Model Checking -- Transfinite Extension of the Mu-Calculus -- Bounded Model Checking of Pointer Programs -- PDL with Intersection and Converse Is Decidable -- On Deciding Topological Classes of Deterministic Tree Languages -- Constructive Reasoning and Computational Mathematics -- Complexity and Intensionality in a Type-1 Framework for Computable Analysis -- Computing with Sequences, Weak Topologies and the Axiom of Choice -- Light Functional Interpretation -- Feasible Proofs of Matrix Properties with Csanky?s Algorithm -- Implicit Computational Complexity and Rewriting -- A Propositional Proof System for Log Space -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems -- Appendices -- The Ackermann Award 2005 -- Clemens Lautemann: 1951-2005 An Obituary. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3634 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aMachine theory 606 $aArtificial intelligence 606 $aMathematical logic 606 $aCompilers and Interpreters 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aArtificial Intelligence 606 $aMathematical Logic and Foundations 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aCompilers and Interpreters. 615 24$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Foundations. 676 $a005.1/015113 702 $aOng$b Luke$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic.$bConference$d(14th :$f2005 :$eOxford, England) 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996465924403316 996 $aComputer Science Logic$9771972 997 $aUNISA