BranchesHistoryFPLHelpLogin
Welcome guest
You're not logged in.
281 users online, thereof 0 logged in

With the concept of negation of strings, we are able to introduce two more desirable properties of a logical calculus:

Definition: Consistency and Negation-Completeness of a Logical Calculus

A logical calculus $L$ is called

Notes:

| | | | | created: 2018-02-10 00:10:25 | modified: 2018-02-11 09:18:45 | by: bookofproofs | references: [656], [7878]

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 4.0 by:

This work is a derivative of:

Bibliography (further reading)

[7878] Beierle, C.; Kern-Isberner, G.: “Methoden wissensbasierter Systeme”, Vieweg, 2000

[656] Hoffmann, Dirk W.: “Grenzen der Mathematik – Eine Reise durch die Kerngebiete der mathematischen Logik”, Spektrum Akademischer Verlag, 2011