Week 1: Propositional Logic, or Boolean Logic

Abstract

Language ϕ ::= p | (¬ϕ) | (ϕ ∧ ϕ) | (ϕ ∨ ϕ) | (ϕ → ϕ) This looks simple, but is quite expressive. Many problems in computer science can be phrased as satisfiability problems for Boolean formulas

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

First-order logical duality.Steve Awodey - 2013 - Annals of Pure and Applied Logic 164 (3):319-348.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
On an Algebra of Lattice-Valued Logic.Lars Hansen - 2005 - Journal of Symbolic Logic 70 (1):282 - 318.
A survey of propositional realizability logic.Valery Plisko - 2009 - Bulletin of Symbolic Logic 15 (1):1-42.
Augustus De Morgan's Boolean Algebra.Daniel D. Merrill - 2005 - History and Philosophy of Logic 26 (2):75-91.
Expressive power and semantic completeness: Boolean connectives in modal logic.I. L. Humberstone - 1990 - Studia Logica 49 (2):197 - 214.
Week 1: Some Testing Challenges Languages Overview Some Boolean Logic.Jan van Eijck - unknown

Analytics

Added to PP
2009-01-28

Downloads
2 (#1,803,862)

6 months
0

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jan Van Eijck
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references