It is well known that the validity of Choice Principles is problematic in non-standard Set Theories which do not abide by the Limitation of Size Principle. In this paper we discuss the consistency of various Choice Principles with respect to the Generalized Positive Comprehension Principle . The Principle GPC allows to take as sets those classes which can be specified by Generalized Positive Formulae, e.g. the universe. In particular we give a complete characterization of which choice principles hold in Hyperuniverses. (...) Hyperuniverses are structures which arose independently in Non-well-founded Set Theory and in Mathematical Semantics of Concurrent Programming Languages and are hitherto the only existing models of GPC. Hyperuniverses are naturally endowed with a κ-compact uniform κ-topology and are uniformly isomorphic to their exponential space, i.e. the space of their closed subsets endowed with the Exponential Uniformity. (shrink)

We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deduction-style proof systems for representing both truth (local) and validity (global) consequence relations for various Modal Logics. We introduce several techniques for encoding the structural peculiarities of necessitation rules, in the typed -calculus metalanguage of the Logical Frameworks. These formalizations yield readily proof-editors for Modal Logics when implemented in Proof Development Environments, such as Coq or LEGO.

The proof of Lemma 5 in our paper “Choice Principles in Hyperuniverses” [3], contains an error. In the present note we show that the statement of that lemma is false and hence the Axiom of Choice fails in all κ-hyperuniverses, for uncountable κ. However, a weaker version of Lemma 5 can be proved, which implies that the Linear Ordering Principle holds in all κ-metric κ-hyperuniverses.