Online resource for type theory?

Click For Summary
The discussion revolves around finding online resources for type theory, particularly concerning the concept of a "universal object" that encompasses all other objects. Participants express a preference for resources that provide depth rather than superficial listings. The conversation touches on the limitations of ZFC set theory and explores alternatives like Quine's "New Foundations" and topos theory, though the latter is deemed unsuitable for the desired properties of a universal object. Additionally, there are discussions about the implications of categories in relation to universal elements and the challenges in defining such concepts within the framework of category theory. Overall, the thread highlights a quest for a more coherent understanding of type theory and its relationship with set theory.
  • #31
New theorem, but I think you already anticipated this one.


Suppose f is a bijection between V and V^V.
Then, every function V--->V has a fixed point.


Proof is roughly the same as the previous one I gave:

Let j by a function from V to V.

Define g(x) = f(x)(x)
Let s = f^-1(j o g)

Then, g(s) = f(s)(s) = (j o g)(s) = j(g(s))

Thus, g(s) is a fixed point of j.
 
Physics news on Phys.org
  • #32
Just a shot in the dark, but does this property characterize the V such that V is in bijection with V^V?

In other words, if every function from V to V has a fixed point, then is V in bijection with V^V?

(This links up with my definition of a awareness, but let's discuss that there and not here.)

I will work on this, too.
 
  • #33
Note that we have a binary composition on V, given by:

VxV ---> (V^V)xV ---> V

Where the first arrow applies the isomorphism to the first argument, and the second arrow is the evaluation morphism.

In a more set theoretic presentation, for a in V, let \bar{a} be the corresponding element in V^V. Then, a \cdot b := \bar{a}(b)

Clearly, in general, this operation appears to be noncommutative and nonassociative. Such a thing is called a "magma"

http://en.wikipedia.org/wiki/Magma_(algebra)

Maybe something in there is useful.


Clearly, elements of a magma M act on that magma by left multiplication, and in this way we recover part of M^M... but not necessarily all of it, I suppose.


Actually, we have what might be a different binary operation. If V is reflexive, then we have VxV <= V. (I've changed notation -- I hate using < when the objects can be isomorphic) By definition, there's a monic VxV --> V, so this can be taken as a binary operation.
 
  • #34
It strikes me that I have not proven it impossible for V^V <= V in a topos either. I'm working on seeing if it can be true for the subobjects of 1 (i.e. the logic values).

Also, technically I have not proven it impossible for PV < V in a topos... there's certainly a monic V --> PV, but I don't know if the existence of a monic PV --> V implies V and PV are isomorphic.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
3
Views
2K