Amazon cover image
Image from Amazon.com

The Logic of Reliable Inquiry.

By: Series: Logic and Computation in Philosophy SerPublisher: Oxford : Oxford University Press, Incorporated, 1996Copyright date: ©1996Description: 1 online resource (449 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780195357875
Subject(s): Genre/Form: Additional physical formats: Print version:: The Logic of Reliable InquiryDDC classification:
  • 121
LOC classification:
  • Q180.55.M4.K45 1996
Online resources:
Contents:
Intro -- Contents -- 1. Introduction -- 2. Reliable Inquiry -- 1. Background Assumptions -- 2. Methods And Data Streams -- 3. Data Protocols -- 4. Truth And Global Underdetermination -- 5. The Philosophy Of Global Underdetermination -- 6. The Philosophy Of Local Underdetermination -- 7. Scientific Realism, Probability, And Subjunctives -- 8. The Logic Of Reliable Inquiry -- 3. The Demons Of Passive Observation -- 1. Introduction -- 2. Decidability With A Deadline -- 3. Decidability, Verifiability, And Refutability With Certainty -- 4. Verification, Refutation, And Decision In The Limit -- 5. Decision With N Mind Changes -- 6. Gradual Verification, Refutation, And Decision -- 7. Optimal Background Assumptions -- 8. Exercises -- 4. Topology And Ideal Hypothesis Assessment -- 1. Introduction -- 2. Basic Topological Concepts -- 3. The Baire Space -- 4. Restricted Topological Spaces -- 5. A Characterization Of Bounded Sample Decidability -- 6. Characterizations Of Certain Assessment -- 7. Characterizations Of Limiting Assessment -- 8. Efficient Data Use -- 9. A Characterization Of N-Mind-Change Decidability -- 10. A Demon-Oriented Characterization Of N-Mind-Change Decidability -- 11. Characterizations Of Gradual Assessment -- 12. The Levels Of Underdetermination -- 13. Exercises -- 5. Reducibility And The Game Of Science -- 1. Introduction -- 2. Ideal Inductive Methods As Continuous Operators On The Baire Space -- 3. Assessment As Reduction -- 4. Ideal Transcendental Deductions As Cnt-Completeness Theorems -- 5. Inductive Demons As Continuous Counterreductions -- 6. Science As A Limiting Game -- 7. Exercises -- 6. The Demons Of Computability -- 1. Introduction -- 2. Church Meets Hume -- 3. Programs As Reliable Methods -- 4. The Arithmetical Hierarchy -- 5. Uncomputability And Diagonalization -- 6. The Demons Of Uncomputability -- 7. Some Disanalogies.
8. Exercises -- 7. Computers In Search Of The Truth -- 1. Ideal Epistemology And Computability -- 2. Computation As Internalized Inductive Inquiry -- 3. The Arithmetical Hierarchy Over The Baire Space -- 4. Universal Relations And Hierarchy Theorems -- 5. Characterization Theorems -- 6. Data-Minimal Computable Methods -- 7. The Empirical Irony Of Cognitive Science -- 8. The Computable Assessment Of Uncomputable Theories -- 9. Ideal Norms And Computational Disasters -- 10. Computable Inquiry -- 11. Exercises -- 8. So Much Time, Such Little Brains -- 1. Introduction -- 2. Finite State Automata -- 3. Regular Sets -- 4. Scientific Automata -- 5. Scientific Automata And Certainty -- 6. Scientific Automata In The Limit -- 7. Limiting Regular Expression -- 8. ω-Expression -- 9. The Inductive Power Of Indeterminism -- 10. Primitive Recursion -- 11. The Empirical Irony Of Cognitive Science Revisited -- 12. Exercises -- 9. The Logic Of Ideal Discovery -- 1. Introduction -- 2. Basic Definitions -- 3. Assessment As Discovery -- 4. Conjectures And Refutations -- 5. A Complete Architecture For Discovery -- 6. Data-Minimal Limiting Discovery -- 7. Discovery With Bounded Mind Changes -- 8. A Characterization Of Almost Stable Identification In The Limit -- 9. Unstable Identification In The Limit -- 10. Gradual Identification -- 11. Exercises -- 10. Computerized Discovery -- 1. Introduction -- 2. Computable Hypothesis Enumerations -- 3. Characterization -- 4. Function Identification -- 5. Cognitive Science Revisited -- 6. Exercises -- 11. Prediction -- 1. Introduction -- 2. Ideal Extrapolation -- 3. Computable Extrapolation -- 4. Exercises -- 12. Inquiry Concerning First-Order Theories -- 1. Introduction -- 2. Logical Hypothesis Assessment From Complete, True Data -- 3. Truth And Underdetermination -- 4. Quantifier Prefix Complexity -- 5. An Example.
6. Data Complexity -- 7. Theories And Axiomatizations -- 8. Theory Discovery -- 9. Discovery And Vocabulary -- 10. Exercises -- 13. Probability And Reliability -- 1. Introduction -- 2. Conditionalization -- 3. Probabilistic Reliability -- 4. Countable Additivity -- 5. Probabilistic Reliability Without Countable Additivity -- 6. Probabilistic Mathematics And Nonprobabilistic Science -- 7. Probabilistic Theories -- 8. Conclusion -- 9. Proofs Of Propositions 13.18 And 13.20 -- 10. Exercises -- 14. Experiment And Causal Inference -- 1. Introduction -- 2. Systems -- 3. Causation And Manipulation -- 4. Variable Causation -- 5. Experimental Methods -- 6. The Course Of Experimental Inquiry -- 7. Hypothesis Correctness And Background Knowledge -- 8. Experimental Reliability -- 9. Dreaming And The Principle Of Plenitude -- 10. Weakened Assumptions And Global Underdetermination -- 11. Exercises -- 15. Relativism And Reliability -- 1. Introduction -- 2. Relativism, Truth, And Interpersonal Agreement -- 3. Relativistic Reliabilism -- 4. Functional Vs. Metaphysical Relativism -- 5. Causal Vs. Semantic Relativism -- 6. Acts, Scientists, And Worlds-In-Themselves -- 7. Transcendental Background Knowledge -- 8. The Course Of Relativistic Inquiry -- 9. Relativistic Hypothesis Assessment -- 10. Relativistic Hypothesis Assessment As Nonrelativistic Discovery -- 11. Relativistic Theory Discovery -- 12. Whiggish Relativism -- 13. Exercises -- 16. Closing Conversation -- References -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Index Of Symbols.
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Ebrary Ebrary Afghanistan Available EBKAF-N00066657
Ebrary Ebrary Algeria Available
Ebrary Ebrary Cyprus Available
Ebrary Ebrary Egypt Available
Ebrary Ebrary Libya Available
Ebrary Ebrary Morocco Available
Ebrary Ebrary Nepal Available EBKNP-N00066657
Ebrary Ebrary Sudan Available
Ebrary Ebrary Tunisia Available
Total holds: 0

Intro -- Contents -- 1. Introduction -- 2. Reliable Inquiry -- 1. Background Assumptions -- 2. Methods And Data Streams -- 3. Data Protocols -- 4. Truth And Global Underdetermination -- 5. The Philosophy Of Global Underdetermination -- 6. The Philosophy Of Local Underdetermination -- 7. Scientific Realism, Probability, And Subjunctives -- 8. The Logic Of Reliable Inquiry -- 3. The Demons Of Passive Observation -- 1. Introduction -- 2. Decidability With A Deadline -- 3. Decidability, Verifiability, And Refutability With Certainty -- 4. Verification, Refutation, And Decision In The Limit -- 5. Decision With N Mind Changes -- 6. Gradual Verification, Refutation, And Decision -- 7. Optimal Background Assumptions -- 8. Exercises -- 4. Topology And Ideal Hypothesis Assessment -- 1. Introduction -- 2. Basic Topological Concepts -- 3. The Baire Space -- 4. Restricted Topological Spaces -- 5. A Characterization Of Bounded Sample Decidability -- 6. Characterizations Of Certain Assessment -- 7. Characterizations Of Limiting Assessment -- 8. Efficient Data Use -- 9. A Characterization Of N-Mind-Change Decidability -- 10. A Demon-Oriented Characterization Of N-Mind-Change Decidability -- 11. Characterizations Of Gradual Assessment -- 12. The Levels Of Underdetermination -- 13. Exercises -- 5. Reducibility And The Game Of Science -- 1. Introduction -- 2. Ideal Inductive Methods As Continuous Operators On The Baire Space -- 3. Assessment As Reduction -- 4. Ideal Transcendental Deductions As Cnt-Completeness Theorems -- 5. Inductive Demons As Continuous Counterreductions -- 6. Science As A Limiting Game -- 7. Exercises -- 6. The Demons Of Computability -- 1. Introduction -- 2. Church Meets Hume -- 3. Programs As Reliable Methods -- 4. The Arithmetical Hierarchy -- 5. Uncomputability And Diagonalization -- 6. The Demons Of Uncomputability -- 7. Some Disanalogies.

8. Exercises -- 7. Computers In Search Of The Truth -- 1. Ideal Epistemology And Computability -- 2. Computation As Internalized Inductive Inquiry -- 3. The Arithmetical Hierarchy Over The Baire Space -- 4. Universal Relations And Hierarchy Theorems -- 5. Characterization Theorems -- 6. Data-Minimal Computable Methods -- 7. The Empirical Irony Of Cognitive Science -- 8. The Computable Assessment Of Uncomputable Theories -- 9. Ideal Norms And Computational Disasters -- 10. Computable Inquiry -- 11. Exercises -- 8. So Much Time, Such Little Brains -- 1. Introduction -- 2. Finite State Automata -- 3. Regular Sets -- 4. Scientific Automata -- 5. Scientific Automata And Certainty -- 6. Scientific Automata In The Limit -- 7. Limiting Regular Expression -- 8. ω-Expression -- 9. The Inductive Power Of Indeterminism -- 10. Primitive Recursion -- 11. The Empirical Irony Of Cognitive Science Revisited -- 12. Exercises -- 9. The Logic Of Ideal Discovery -- 1. Introduction -- 2. Basic Definitions -- 3. Assessment As Discovery -- 4. Conjectures And Refutations -- 5. A Complete Architecture For Discovery -- 6. Data-Minimal Limiting Discovery -- 7. Discovery With Bounded Mind Changes -- 8. A Characterization Of Almost Stable Identification In The Limit -- 9. Unstable Identification In The Limit -- 10. Gradual Identification -- 11. Exercises -- 10. Computerized Discovery -- 1. Introduction -- 2. Computable Hypothesis Enumerations -- 3. Characterization -- 4. Function Identification -- 5. Cognitive Science Revisited -- 6. Exercises -- 11. Prediction -- 1. Introduction -- 2. Ideal Extrapolation -- 3. Computable Extrapolation -- 4. Exercises -- 12. Inquiry Concerning First-Order Theories -- 1. Introduction -- 2. Logical Hypothesis Assessment From Complete, True Data -- 3. Truth And Underdetermination -- 4. Quantifier Prefix Complexity -- 5. An Example.

6. Data Complexity -- 7. Theories And Axiomatizations -- 8. Theory Discovery -- 9. Discovery And Vocabulary -- 10. Exercises -- 13. Probability And Reliability -- 1. Introduction -- 2. Conditionalization -- 3. Probabilistic Reliability -- 4. Countable Additivity -- 5. Probabilistic Reliability Without Countable Additivity -- 6. Probabilistic Mathematics And Nonprobabilistic Science -- 7. Probabilistic Theories -- 8. Conclusion -- 9. Proofs Of Propositions 13.18 And 13.20 -- 10. Exercises -- 14. Experiment And Causal Inference -- 1. Introduction -- 2. Systems -- 3. Causation And Manipulation -- 4. Variable Causation -- 5. Experimental Methods -- 6. The Course Of Experimental Inquiry -- 7. Hypothesis Correctness And Background Knowledge -- 8. Experimental Reliability -- 9. Dreaming And The Principle Of Plenitude -- 10. Weakened Assumptions And Global Underdetermination -- 11. Exercises -- 15. Relativism And Reliability -- 1. Introduction -- 2. Relativism, Truth, And Interpersonal Agreement -- 3. Relativistic Reliabilism -- 4. Functional Vs. Metaphysical Relativism -- 5. Causal Vs. Semantic Relativism -- 6. Acts, Scientists, And Worlds-In-Themselves -- 7. Transcendental Background Knowledge -- 8. The Course Of Relativistic Inquiry -- 9. Relativistic Hypothesis Assessment -- 10. Relativistic Hypothesis Assessment As Nonrelativistic Discovery -- 11. Relativistic Theory Discovery -- 12. Whiggish Relativism -- 13. Exercises -- 16. Closing Conversation -- References -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Index Of Symbols.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2019. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.