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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
1995
Review
1995
An approach to the problem of developing provably correct programs has been to enrich a theorem prover for Hoare logic with…