First Page | Document Content | |
---|---|---|
![]() Date: 2007-08-09 21:04:38Logic Mathematical logic Abstraction Proof theory Propositional calculus Predicate logic Logical truth First-order logic Tautology Existential graph Cut-elimination theorem Well-formed formula | Add to Reading List |
![]() | Query Graphs with Cuts: Mathematical Foundations Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,DocID: 1rhkc - View Document |
![]() | Some Notes on Proofs with Alpha Graphs Frithjof Dau Technische Universit¨ at Dresden, Dresden, GermanyDocID: 1r1sv - View Document |
![]() | Fixing Shin’s Reading Algorithm for Peirce’s Existential Graphs Frithjof Dau Technische Universit¨ at DresdenDocID: 1qQQb - View Document |
![]() | Contents 1 Formal Logic with Conceptual Graphs Frithjof Dau 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . 1.2 Short Introduction to Conceptual Graphs . . . . .DocID: 1qNy3 - View Document |
![]() | Constants and Functions in Peirce’s Existential Graphs Frithjof Dau University of Wollongong, AustraliaDocID: 1qHfo - View Document |