You are currently offline. Some features of the site may not work correctly.

# Independence of premise

In proof theory and constructive mathematics, the principle of independence of premise states that if φ and ∃ x θ are sentences in a formal theory… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
• Y. Akama
• Mathematical Structures in Computer Science
• 2014
• Corpus ID: 14639578
For any partial combinatory algebra (PCA for short) $\mathcal{A}$, the class of $\mathcal{A}$-representable partial functions… Expand
2011
2011
• Notre Dame J. Formal Log.
• 2011
• Corpus ID: 28012639
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus… Expand
1993
1993
Abstract We introduce the foundational issues involved in incorporating the NEGATION as FAILURE (NAF) rule into the framework of… Expand
1992
1992
It is known that larger classes of formulae than Horn clauses may be used as logic programming languages. One such class of… Expand