Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automated Reasoning with Analytic Tableaux and Related Methods : 24th International Conference, TABLEAUX 2015, Wroclaw, Poland, September 21-24, 2015, Proceedings / / edited by Hans De Nivelle
| Automated Reasoning with Analytic Tableaux and Related Methods : 24th International Conference, TABLEAUX 2015, Wroclaw, Poland, September 21-24, 2015, Proceedings / / edited by Hans De Nivelle |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVI, 355 p. 70 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Computer programming Software engineering Computer science—Mathematics Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Programming Techniques Software Engineering Discrete Mathematics in Computer Science Logics and Meanings of Programs |
| ISBN | 3-319-24312-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910586623703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2003, Rome, Italy, September 9-12, 2003. Proceedings / / edited by Marta Cialdea Mayer, Fiora Pirri
| Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2003, Rome, Italy, September 9-12, 2003. Proceedings / / edited by Marta Cialdea Mayer, Fiora Pirri |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Number theory Computer science Computer programming Software engineering Logic, Symbolic and mathematical Artificial Intelligence Number Theory Computer Science, general Programming Techniques Software Engineering Mathematical Logic and Formal Languages |
| ISBN | 3-540-45206-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Short Abstracts of Invited Lectures -- Non Commutative Logic: A Survey (Abstract) -- Dynamical Method in Algebra: A Survey (Abstract) -- Automated Theorem Proving in Generation, Verification, and Certification of Safety Critical Code (Abstract) -- Research Papers -- Tableaux with Four Signs as a Unified Framework -- A Labelled Sequent-Calculus for Observation Logic -- Bounded ?ukasiewicz Logics -- Parallel Dialogue Games and Hypersequents for Intermediate Logics -- Simplification Rules for Constrained Formula Tableaux -- Tableau Calculi for Preference-Based Conditional Logics -- A General Tableau Method for Propositional Interval Temporal Logics -- Universal Variables in Disconnection Tableaux -- A Tableau Algorithm for Reasoning about Concepts and Similarity -- XPath and Modal Logics of Finite DAG‘s -- Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation -- A More Efficient Tableaux Procedure for Simultaneous Search for Refutations and Finite Models -- Automatic Abstraction of Equations in a Logic of Equality -- A Free Variable Sequent Calculus with Uniform Variable Splitting -- System Description -- The Tableaux Work Bench -- Decision Procedures for the Propositional Cases of Second Order Logic and Z Modal Logic Representations of a First Order L-Predicate Nonmonotonic Logic -- Logistica 2.0: A Technology for Implementing Automatic Deduction Systems -- Fair Constraint Merging Tableaux in Lazy Functional Programming Style -- SOLAR: A Consequence Finding System for Advanced Reasoning -- CondLean: A Theorem Prover for Conditional Logics. |
| Record Nr. | UNINA-9910143863903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller
| Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2002. Copenhagen, Denmark, July 30 - August 1, 2002. Proceedings / / edited by Uwe Egly, Christian G. Fernmüller |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 346 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Software engineering Computer programming Artificial Intelligence Mathematical Logic and Formal Languages Software Engineering Programming Techniques |
| ISBN | 3-540-45616-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Proof Analysis by Resolution -- Using Linear Logic to Reason about Sequent Systems -- Research Papers -- A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic -- Tableaux for Quantified Hybrid Logic -- Tableau-Based Automated Deduction for Duration Calculus -- Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge -- A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic -- Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks -- Tableau Calculi for the Logics of Finite k-Ary Trees -- A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition -- Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment -- Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas -- Integration of Equality Reasoning into the Disconnection Calculus -- Analytic Sequent Calculi for Abelian and ?ukasiewicz Logics -- Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief -- A Confluent Theory Connection Calculus -- On Uniform Word Problems Involving Bridging Operators on Distributive Lattices -- Question Answering: From Partitions to Prolog -- A General Theorem Prover for Quantified Modal Logics -- Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem -- A New Indefinite Semantics for Hilbert’s Epsilon -- A Tableau Calculus for Combining Non-disjoint Theories -- System Descriptions Papers -- LINK: A Proof Environment Based on Proof Nets -- DCTP 1.2 — System Abstract. |
| Record Nr. | UNINA-9910143899803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings / / edited by Roy Dyckhoff
| Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings / / edited by Roy Dyckhoff |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 440 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Programming languages (Electronic computers) Logic, Symbolic and mathematical Artificial Intelligence Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-45008-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Tableau Algorithms for Description Logics -- Modality and Databases -- Local Symmetries in Propositional Logic -- Comparison -- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison -- Consistency Testing: The RACE Experience -- Benchmark Analysis with FaCT -- MSPASS: Modal Reasoning by Translation and First-Order Resolution -- TANCS-2000 Results for DLP -- Evaluating *SAT on TANCS 2000 Benchmarks -- Research Papers -- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations -- A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus -- An Analytic Calculus for Quantified Propositional Gödel Logic -- A Tableau Method for Inconsistency-Adaptive Logics -- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning -- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics -- Variants of First-Order Modal Logics -- Complexity of Simple Dependent Bimodal Logics -- Properties of Embeddings from Int to S4 -- Term-Modal Logics -- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics -- Dual Intuitionistic Logic Revisited -- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions -- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints -- Matrix-Based Inductive Theorem Proving -- Monotonic Preorders for Free Variable Tableaux -- The Mosaic Method for Temporal Logics -- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5 -- A Tableau Calculus for Equilibrium Entailment -- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory -- Tableau Calculus for Only Knowing and Knowing At Most -- A Tableau-Like Representation Framework for Efficient Proof Reconstruction -- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson’s Arithmetic Q -- System Descriptions -- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO -- E-SETHEO: An Automated3 Theorem Prover. |
| Record Nr. | UNINA-9910767560303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : International Conference, TABLEAUX'97, Pont-a-Mousson, France, May 13-16, 1997 Proceedings / / edited by Didier Galmiche
| Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : International Conference, TABLEAUX'97, Pont-a-Mousson, France, May 13-16, 1997 Proceedings / / edited by Didier Galmiche |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 380 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computer architecture
Artificial intelligence Logic, Symbolic and mathematical Computer System Implementation Artificial Intelligence Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
| ISBN | 3-540-69046-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | MGTP: A model generation theorem prover — Its advanced features and applications — -- Three faces of natural deduction -- Tableaux for logic programming with strong negation -- Generalized tableau systems for intermediate propositional logics -- Lean induction principles for tableaux -- Tableaux for diagnosis applications -- Free variable tableaux for propositional modal logics -- A sequent calculus for skeptical Default Logic -- A fast saturation strategy for set-theoretic tableaux -- Hintikka multiplicities in matrix decision methods for some propositional modal logics -- Automated natural deduction prover and experiments -- Non-elementary speed-ups in proof length by different variants of classical analytic calculi -- Ordered tableaux: Extensions and applications -- Two loop detection mechanisms: A comparison -- Subgoal alternation in model elimination -- Projection: A unification procedure for tableaux in Conceptual Graphs -- On quasitautologies -- Tableaux methods for access control in distributed systems -- Proving correctness of labeled transition systems by semantic tableaux -- Tableau methods for PA-processes -- A tableau proof system for a mazurkiewicz trace logic with fixpoints -- ileanTAP: An intuitionistic theorem prover -- Simplifying and generalizing formulae in tableaux. Pruning the search space and building models -- A framework for using knowledge in tableau proofs -- A sequent calculus for reasoning in four-valued Description Logics -- Tableaux for functional dependencies and independencies. |
| Record Nr. | UNINA-9910768459603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Technology for Verification and Analysis : 16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings / / edited by Shuvendu K. Lahiri, Chao Wang
| Automated Technology for Verification and Analysis : 16th International Symposium, ATVA 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings / / edited by Shuvendu K. Lahiri, Chao Wang |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIII, 560 p. 133 illus.) |
| Disciplina |
004.015113
006.333 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer security Computer simulation Computer logic Logic, Symbolic and mathematical Software Engineering Programming Languages, Compilers, Interpreters Systems and Data Security Simulation and Modeling Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN |
9783030010904
3030010902 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal Methods -- Verification -- Program Synthesis -- Model Checking -- Theorem Proving -- Software Verification -- SAT Solver -- SMT Solver -- Automation Logic. |
| Record Nr. | UNINA-9910349402203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Automation of Reasoning with Incomplete Information [[electronic resource] ] : From Semantic Foundations to Efficient Computation / / by Torsten Schaub
| The Automation of Reasoning with Incomplete Information [[electronic resource] ] : From Semantic Foundations to Efficient Computation / / by Torsten Schaub |
| Autore | Schaub Torsten |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIV, 166 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-69793-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The original approach: Classical default logic -- An alternative approach: Constrained default logic -- Putting default logics into perspective -- A context-based framework for default logics -- Possible worlds semantics for default logics -- Adding specificity to default logics -- Adding lemma handling to default logics -- Query-answering in default logics -- A Prolog-technology compiler for query-answering -- Conclusions and perspectives. |
| Record Nr. | UNINA-9910143474603321 |
Schaub Torsten
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Autonomy Platonism and the indispensability argument / / Russell Marcus
| Autonomy Platonism and the indispensability argument / / Russell Marcus |
| Autore | Marcus Russell <1966-> |
| Pubbl/distr/stampa | Lanham, Maryland : , : Lexington Books, , 2015 |
| Descrizione fisica | 1 online resource (259 p.) |
| Disciplina | 160 |
| Soggetto topico |
Logic, Symbolic and mathematical
Mathematics - Philosophy Platonists |
| Soggetto genere / forma | Electronic books. |
| ISBN | 0-7391-7313-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
British Library Cataloguing in Publication Information Available; Library of Congress Cataloging-in-Publication Data; Printed in the United States of America; Preface; Chapter 1 - Platonism Overview; Chapter One Platonism: An Overview; Benacerraf's Dilemma; Anti-Platonistic Responses to Benacerraf's Dilemma; Access Problem; Platonistic Responses to Benacerraf's Dilemma: Indispensability Platonism; Platonistic Responses to Benacerraf's Dilemma: Autonomy Platonism; Chapter Two The Quinean Indispensability Argument; Quine's Argument; Quine's Naturalism; Quine's Holism
Physicalism and PluralismBelieving Our Best Theory and the Double-Talk Argument; Quine's Procedure for Determining the Commitments of a Theory; Mathematization; Confirmation Holism and Disciplinary Boundaries; Problems for the Quinean Method for Determining Ontological Commitment; Names and Quantifiers; First-Order Logic and Higher-Order Logics; The Regimentation of Commitment; Whither QI?; Chapter 4 - The Weasel; Chapter Four The Weasel; The Original Weasel; Melia's Weaseling Strategy; Leng's Recreational Weasel; The Weasel at Work; Speaking Seriously in Mathematics Quine against the Weasel Autonomy Platonism and the Weasel; Traditional Platonism ; The Indispensabilist's Mathematics; Restriction; Ontic Blur and Causality; Modal Uniformity and Temporality; The Indispensabilist's Methods; The Unfortunate Consequences; Other Quinean Indispensability Arguments; Embracing the Unfortunate Consequences ; The Way Forward; Putnam and the Quinean Argument; Putnam's Success Argument; Melia's Two Indispensability Arguments; Resnik's Pragmatic Argument; Other Non-Holistic Indispensability Arguments; Indispensability, Theories, and Explanations The Explanatory Indispensability Argument The Origins of the Explanatory Argument; Mathematical Explanations in Science; Two Concepts of Explanation; Epistemic Explanation and the Explanatory Indispensability Argument; Weaseling Away the Explanatory Argument (But Not the Standard Argument); Toward an Autonomy Platonist Solution; From Indispensability to Autonomy Platonism; From Fictionalism to Autonomy Platonism; Mathematics as Logic; Chapter 9 - Plenitudinous Platonism; Chapter Nine Plenitudinous Platonism; Two Versions of Autonomy Platonism ; Plenitudinous Platonism FBP and PlenitudeFBP and Necessity; Chapter 10 - Intuition-Based Autonomy Platonism; Chapter Ten Intuition-Based Autonomy Platonism; McEvoy's Sketch; Mathematical Intuition; A Fallibilist Account of Mathematical Intuition; Mathematical Intuition and Philosophical Intuition; Unhelpful Characterizations of Mathematical Intuition; Mathematical Intuition and Mysterianism; The Unsurprising Reliability of Mathematical Intuition; From Mathematical Intuition to Mathematical Theory; On What Mathematical Objects There Are; The Yield of Intuition-Based Autonomy Platonism Security and Fallibility |
| Record Nr. | UNINA-9910460874403321 |
|
Marcus Russell <1966->
|
||
| Lanham, Maryland : , : Lexington Books, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Autonomy Platonism and the indispensability argument / / Russell Marcus
| Autonomy Platonism and the indispensability argument / / Russell Marcus |
| Autore | Marcus Russell <1966-> |
| Pubbl/distr/stampa | Lanham, Maryland : , : Lexington Books, , 2015 |
| Descrizione fisica | 1 online resource (259 p.) |
| Disciplina | 160 |
| Soggetto topico |
Logic, Symbolic and mathematical
Mathematics - Philosophy Platonists |
| ISBN | 0-7391-7313-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
British Library Cataloguing in Publication Information Available; Library of Congress Cataloging-in-Publication Data; Printed in the United States of America; Preface; Chapter 1 - Platonism Overview; Chapter One Platonism: An Overview; Benacerraf's Dilemma; Anti-Platonistic Responses to Benacerraf's Dilemma; Access Problem; Platonistic Responses to Benacerraf's Dilemma: Indispensability Platonism; Platonistic Responses to Benacerraf's Dilemma: Autonomy Platonism; Chapter Two The Quinean Indispensability Argument; Quine's Argument; Quine's Naturalism; Quine's Holism
Physicalism and PluralismBelieving Our Best Theory and the Double-Talk Argument; Quine's Procedure for Determining the Commitments of a Theory; Mathematization; Confirmation Holism and Disciplinary Boundaries; Problems for the Quinean Method for Determining Ontological Commitment; Names and Quantifiers; First-Order Logic and Higher-Order Logics; The Regimentation of Commitment; Whither QI?; Chapter 4 - The Weasel; Chapter Four The Weasel; The Original Weasel; Melia's Weaseling Strategy; Leng's Recreational Weasel; The Weasel at Work; Speaking Seriously in Mathematics Quine against the Weasel Autonomy Platonism and the Weasel; Traditional Platonism ; The Indispensabilist's Mathematics; Restriction; Ontic Blur and Causality; Modal Uniformity and Temporality; The Indispensabilist's Methods; The Unfortunate Consequences; Other Quinean Indispensability Arguments; Embracing the Unfortunate Consequences ; The Way Forward; Putnam and the Quinean Argument; Putnam's Success Argument; Melia's Two Indispensability Arguments; Resnik's Pragmatic Argument; Other Non-Holistic Indispensability Arguments; Indispensability, Theories, and Explanations The Explanatory Indispensability Argument The Origins of the Explanatory Argument; Mathematical Explanations in Science; Two Concepts of Explanation; Epistemic Explanation and the Explanatory Indispensability Argument; Weaseling Away the Explanatory Argument (But Not the Standard Argument); Toward an Autonomy Platonist Solution; From Indispensability to Autonomy Platonism; From Fictionalism to Autonomy Platonism; Mathematics as Logic; Chapter 9 - Plenitudinous Platonism; Chapter Nine Plenitudinous Platonism; Two Versions of Autonomy Platonism ; Plenitudinous Platonism FBP and PlenitudeFBP and Necessity; Chapter 10 - Intuition-Based Autonomy Platonism; Chapter Ten Intuition-Based Autonomy Platonism; McEvoy's Sketch; Mathematical Intuition; A Fallibilist Account of Mathematical Intuition; Mathematical Intuition and Philosophical Intuition; Unhelpful Characterizations of Mathematical Intuition; Mathematical Intuition and Mysterianism; The Unsurprising Reliability of Mathematical Intuition; From Mathematical Intuition to Mathematical Theory; On What Mathematical Objects There Are; The Yield of Intuition-Based Autonomy Platonism Security and Fallibility |
| Record Nr. | UNINA-9910797395203321 |
|
Marcus Russell <1966->
|
||
| Lanham, Maryland : , : Lexington Books, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Autonomy Platonism and the indispensability argument / / Russell Marcus
| Autonomy Platonism and the indispensability argument / / Russell Marcus |
| Autore | Marcus Russell <1966-> |
| Pubbl/distr/stampa | Lanham, Maryland : , : Lexington Books, , 2015 |
| Descrizione fisica | 1 online resource (259 p.) |
| Disciplina | 160 |
| Soggetto topico |
Logic, Symbolic and mathematical
Mathematics - Philosophy Platonists |
| ISBN | 0-7391-7313-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
British Library Cataloguing in Publication Information Available; Library of Congress Cataloging-in-Publication Data; Printed in the United States of America; Preface; Chapter 1 - Platonism Overview; Chapter One Platonism: An Overview; Benacerraf's Dilemma; Anti-Platonistic Responses to Benacerraf's Dilemma; Access Problem; Platonistic Responses to Benacerraf's Dilemma: Indispensability Platonism; Platonistic Responses to Benacerraf's Dilemma: Autonomy Platonism; Chapter Two The Quinean Indispensability Argument; Quine's Argument; Quine's Naturalism; Quine's Holism
Physicalism and PluralismBelieving Our Best Theory and the Double-Talk Argument; Quine's Procedure for Determining the Commitments of a Theory; Mathematization; Confirmation Holism and Disciplinary Boundaries; Problems for the Quinean Method for Determining Ontological Commitment; Names and Quantifiers; First-Order Logic and Higher-Order Logics; The Regimentation of Commitment; Whither QI?; Chapter 4 - The Weasel; Chapter Four The Weasel; The Original Weasel; Melia's Weaseling Strategy; Leng's Recreational Weasel; The Weasel at Work; Speaking Seriously in Mathematics Quine against the Weasel Autonomy Platonism and the Weasel; Traditional Platonism ; The Indispensabilist's Mathematics; Restriction; Ontic Blur and Causality; Modal Uniformity and Temporality; The Indispensabilist's Methods; The Unfortunate Consequences; Other Quinean Indispensability Arguments; Embracing the Unfortunate Consequences ; The Way Forward; Putnam and the Quinean Argument; Putnam's Success Argument; Melia's Two Indispensability Arguments; Resnik's Pragmatic Argument; Other Non-Holistic Indispensability Arguments; Indispensability, Theories, and Explanations The Explanatory Indispensability Argument The Origins of the Explanatory Argument; Mathematical Explanations in Science; Two Concepts of Explanation; Epistemic Explanation and the Explanatory Indispensability Argument; Weaseling Away the Explanatory Argument (But Not the Standard Argument); Toward an Autonomy Platonist Solution; From Indispensability to Autonomy Platonism; From Fictionalism to Autonomy Platonism; Mathematics as Logic; Chapter 9 - Plenitudinous Platonism; Chapter Nine Plenitudinous Platonism; Two Versions of Autonomy Platonism ; Plenitudinous Platonism FBP and PlenitudeFBP and Necessity; Chapter 10 - Intuition-Based Autonomy Platonism; Chapter Ten Intuition-Based Autonomy Platonism; McEvoy's Sketch; Mathematical Intuition; A Fallibilist Account of Mathematical Intuition; Mathematical Intuition and Philosophical Intuition; Unhelpful Characterizations of Mathematical Intuition; Mathematical Intuition and Mysterianism; The Unsurprising Reliability of Mathematical Intuition; From Mathematical Intuition to Mathematical Theory; On What Mathematical Objects There Are; The Yield of Intuition-Based Autonomy Platonism Security and Fallibility |
| Record Nr. | UNINA-9910813846503321 |
|
Marcus Russell <1966->
|
||
| Lanham, Maryland : , : Lexington Books, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
