Article contents
Undefinability of κ-well-orderings in L∞κ
Published online by Cambridge University Press: 12 March 2014
Abstract
We prove that the class of trees with no branches of cardinality ≤ κ is not RPC definable in L∞κ when κ is regular. Earlier such a result was known for under the assumption κ<κ = κ. Our main result is actually proved in a stronger form which covers also L∞κ (and makes sense there) for every strong limit cardinal λ < κ of cofinality κ.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1997
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline2.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline5.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027015703189-0888:S0022481200016145_inline6.gif?pub-status=live)
- 3
- Cited by