Results 261 to 270 of about 1,012,276 (331)

The Degree Of Completeness Of Some Fragments Of The Intuitionistic Propositional Logic

, 1973
Andrzej Wroński
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Propositional Logic I

Introduction to Logic, 2018
Irving M. Copi, Carl Cohen, Victor Rodych   +2 more
openaire   +2 more sources

Propositional Logic

Artificial Intelligence, 2021
C. Aggarwal
openaire   +2 more sources

Propositional Logic

Undergraduate Texts in Mathematics, 2019
Jiacun Wang, William Tepfenhart
openaire   +2 more sources

PEIRCE’S CALCULI FOR CLASSICAL PROPOSITIONAL LOGIC

The Review of Symbolic Logic, 2018
This article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra.
Minghui Ma, A. Pietarinen
semanticscholar   +1 more source

Propositional Dynamic Logic for Hyperproperties

International Conference on Concurrency Theory, 2019
Information security properties of reactive systems like non-interference often require relating different executions of the system to each other and following them simultaneously.
J. Gutsfeld, M. Müller-Olm, Christoph Ohrem   +2 more
semanticscholar   +1 more source

Propositional logic

2004
In propositional logic, atomic formulas are propositions. Any assertion will do. For example, . . . A = “Aristotle is dead,” B = “Barcelona is on the Seine,” and C = “Courtney Love is tall” . . . are atomic formulas. Atomic formulas are the building blocks used to construct sentences. In any logic, a sentence is regarded as a particular type of formula.
Richard Lassaigne, Michel de Rougemont
  +6 more sources

Propositional Logic

Encyclopedia of Machine Learning and Data Mining, 2017
L. Polkowski
semanticscholar   +3 more sources

PAL – Propositional Algorithmic Logic

Fundamenta Informaticae, 1981
The aim of propositional algorithmic logic is to investigate the properties of program connectives. Complete axiomatic systems for deterministic as well as for nondeterministic interpretations of program variables are presented. They constitute basic sets of tools useful in the practice of proving the properties of program schemes.
openaire   +2 more sources