Books+ Search Results

The Logic System of Concept Graphs with Negation And Its Relationship to Predicate Logic

Title
The Logic System of Concept Graphs with Negation [electronic resource] : And Its Relationship to Predicate Logic / by Frithjof Dau.
ISBN
9783540400622
Edition
1st ed. 2003.
Publication
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Physical Description
1 online resource (XII, 216 p.)
Local Notes
Access is available to the Yale community.
Access and use
Access restricted by licensing agreement.
Summary
The aim of contextual logic is to provide a formal theory of elementary logic, which is based on the doctrines of concepts, judgements, and conclusions. Concepts are mathematized using Formal Concept Analysis (FCA), while an approach to the formalization of judgements and conclusions is conceptual graphs, based on Peirce's existential graphs. Combining FCA and a mathematization of conceptual graphs yields so-called concept graphs, which offer a formal and diagrammatic theory of elementary logic. Expressing negation in contextual logic is a difficult task. Based on the author's dissertation, this book shows how negation on the level of judgements can be implemented. To do so, cuts (syntactical devices used to express negation) are added to concept graphs. As we can express relations between objects, conjunction and negation in judgements, and existential quantification, the author demonstrates that concept graphs with cuts have the expressive power of first-order predicate logic. While doing so, the author distinguishes between syntax and semantics, and provides a sound and complete calculus for concept graphs with cuts. The author's treatment is mathematically thorough and consistent, and the book gives the necessary background on existential and conceptual graphs.
Variant and related titles
Springer ENIN.
Other formats
Printed edition:
Printed edition:
Format
Books / Online
Language
English
Added to Catalog
April 05, 2023
Series
Lecture Notes in Artificial Intelligence, 2892
Lecture Notes in Artificial Intelligence, 2892
Contents
Start
1 Introduction
2 Basic Definitions
Alpha
3 Overview for Alpha
4 Semantics for Nonexistential Concept Graphs
5 Calculus for Nonexistential Concept Graphs
6 Soundness and Completeness
Beta
7 Overview for Beta
8 First Order Logic
9 Semantics for Existential Concept Graphs
10 Calculus for Existential Concept Graphs
11 Syntactical Equivalence to FOL
12 Summary of Beta
13 Concept Graphs without Cuts
14 Design Decisions.
Also listed under
SpringerLink (Online service)
Citation

Available from:

Online
Loading holdings.
Unable to load. Retry?
Loading holdings...
Unable to load. Retry?