A generalized small model property for languages which force the infinity
classification
🧮 math.LO
math.CO
keywords
forceformulasinfinityassignmentdealsfinitegeneralizedinfer
read the original abstract
This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.