Skip to search formSkip to main contentSkip to account menu

Decidable sublanguages of set theory

In mathematical logic, various sublanguages of set theory are decidable. These include: * Sets with Monotone, Additive, and Multiplicative Functions… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations

Broader (1)

Logic in computer science
Set theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
1995
Review
1995
The Average Case Complexity of Multilevel Syllogistic
An approach to the problem of developing provably correct programs has been to enrich a theorem prover for Hoare logic with… 
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)