scholarly journals Constructing a small category of setoids

2011 ◽  
Vol 22 (1) ◽  
pp. 103-121 ◽  
Author(s):  
OLOV WILANDER

Consider the first-order theory of a category.d It has a sort of objects, and a sort of arrows (so we may think of it as a small category). We show that, assuming the principle of unique substitutions, the setoids inside a type theoretic universe provide a model for this first-order theory. We also show that the principle of unique substitutions is not derivable in type theory, but that it is strictly weaker than the principle of unique identity proofs.

Computability ◽  
2019 ◽  
Vol 8 (3-4) ◽  
pp. 347-358
Author(s):  
Matthew Harrison-Trainor

2015 ◽  
Vol 57 (2) ◽  
pp. 157-185 ◽  
Author(s):  
Peter Franek ◽  
Stefan Ratschan ◽  
Piotr Zgliczynski

1990 ◽  
Vol 55 (2) ◽  
pp. 626-636
Author(s):  
John T. Baldwin

AbstractLet T be a complete countable first order theory and λ an uncountable cardinal. Theorem 1. If T is not superstable, T has 2λ resplendent models of power λ. Theorem 2. If T is strictly superstable, then T has at least min(2λ, ℶ2) resplendent models of power λ. Theorem 3. If T is not superstable or is small and strictly superstable, then every resplendent homogeneous model of T is saturated. Theorem 4 (with Knight). For each μ ∈ ω ∪ {ω, 2ω} there is a recursive theory in a finite language which has μ resplendent models of power κ for every infinite κ.


Sign in / Sign up

Export Citation Format

Share Document