Catálogo de publicaciones - libros

Compartir en
redes sociales


The Age of Alternative Logics: Assessing Philosophy of Logic and Mathematics Today

Johan van Benthem ; Gerhard Heinzmann ; Manuel Rebuschi ; Henk Visser (eds.)

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

No disponibles.

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2006 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-1-4020-5011-4

ISBN electrónico

978-1-4020-5012-1

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer 2006

Tabla de contenidos

Introduction: Alternative Logics and Classical Concerns

Johan van Benthem

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part I - Proof, Knowledge and Computation | Pp. 1-7

Epistemic Models, Logical Monotony and Substructural Logics

Mikaël Cozic

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part I - Proof, Knowledge and Computation | Pp. 11-23

Semantics as Based on Inference

Jaroslav Peregrin

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part I - Proof, Knowledge and Computation | Pp. 25-36

Effectiveness

Stewart Shapiro

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part I - Proof, Knowledge and Computation | Pp. 37-49

Does Gödel's Incompleteness Theorem Prove that Truth Transcends Proof?

Joseph Vidal-Rosset

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part I - Proof, Knowledge and Computation | Pp. 51-73

Transpositions

Henk Visser

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part I - Proof, Knowledge and Computation | Pp. 75-86

Many-Valued and Kripke Semantics

Jean-Yves Béziau

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part II - Truth Values Beyond Bivalence | Pp. 89-101

The Logic of Complementarity

Newton C. A. da Costa; Décio Krause

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part II - Truth Values Beyond Bivalence | Pp. 103-120

Semantics for Naive Set Theory in Many-Valued Logics

Thierry Libert

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part II - Truth Values Beyond Bivalence | Pp. 121-136

Continuity and Logical Completeness: An Application of Sheaf Theory and Topoi

Steve Awodey

The paper describes the way in which a Preference Semantics system for natural language analysis and generation tackles a difficult class of anaphoric inference problems: those requiring either analytic (conceptual) knowledge of a complex sort, or requiring weak inductive knowledge of the course of events in the real world. The method employed converts all available knowledge to a canonical template form and endeavors to create chains of non-deductive inferences from the unknowns to the possible referents. Its method for this is consistent with the overall principle of ‘‘semantic preference’’ used to set up the original meaning representation

Part III - Category-Theoretic Structures | Pp. 139-149