Pages that link to "Item:Q4647581"
From MaRDI portal
The following pages link to Decidability of all minimal models (Q4647581):
Displaying 8 items.
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- Unary PCF is decidable (Q1274980) (← links)
- Model-checking games for typed \(\lambda\)-calculi (Q2864164) (← links)
- (Q3491528) (← links)
- A decidable subclass of the minimal Gödel class with identity (Q3695254) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- (Q5428934) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)