Skip to search formSkip to main contentSkip to account menu

Kleene–Rosser paradox

Known as: Kleene-Rosser paradox 
In mathematics, the Kleene–Rosser paradox is a paradox that shows that certain systems of formal logic are inconsistent, in particular the version of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Combinatory logicDeductive lambda calculusRecursion (computer science)Type theory

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Quine ’ s “ New Foundations ” is consistent
In this paper we will present a proof of the consistency of Quine’s set theory “New Foundations” (hereinafter NF), so-called… 
2016
2016
An Entailment Procedure for Kleene Answer Set Programs
Classical Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm… 
Review
2016
Review
2016
Lambda calculus with types ∗
§1 Types have been first invented about a century ago in order to avoid contradictions in logic and so-called foundations of… 
2013
2013
Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract
We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal… 
2008
2008
The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NO
After examining the {\bf P} versus {\bf NP} problem against the Kleene-Rosser paradox of the $\lambda$-calculus [94], it was… 
Review
2006
Review
2006
Place-valued Logics around Cybernetic Ontology, the BCL and AFOSR
The Polish logician Roman Suszko has extensively pleaded in the 1970s for a restatement of the notion of many-valuedness… 
1999
1999
Embedding lattices in the Kleene degrees
Under ZFC+CH, we prove that some lattices whose cardinalities do not exceed א1 can be embedded in some local structures of Kleene… 
1997
1997
On decomposition of Kleene TDDs
Kleene-TDDs are useful for evaluating logic functions in the presence of unknown inputs, 0 or 1. Although Kleene-TDD-based logic… 
1981
1981
Painting of banksia aemula by Celia Rosser
1973
1973
A generalised Kleene-Rosser paradox for a system containing the combinator K
  • M. Bunder
  • Notre Dame J. Formal Log.
  • 1973
  • Corpus ID: 28120679
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)