Symmetric Set Theory: A General Theory of Isomorphism, Abstraction, and Representation
It is possible to represent a finite set of points (atoms) by a finite sequence of points. However a finite set of points has no distinguished member and therefore it is impossible to define a function which takes a finite set of points and returns a "first" point in that set. Thus i...
Main Author: | McAllester, David Allen |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6381 |
Similar Items
-
ONTIC: A Knowledge Representation System for Mathematics
by: McAllester, David Allen
Published: (2004) -
The Use of Equality in Deduction and Knowledge Representation
by: McAllester, David Allen
Published: (2004) -
Power Set Models of Lambda-Calculus: Theories, Expansions, Isomorphisms
by: Longo, Guiseppe
Published: (2023) -
Partially Symmetric Functions Are Efficiently Isomorphism Testable
by: Blais, Eric, et al.
Published: (2015) -
Solving Uninterpreted Equations with Context Free Expression Grammars
by: McAllester, David Allen
Published: (2004)