Infinitary Logic

We have now mapped the set of analogies Ai,j to conceptual and mechanical meanings. This allows us to recognize how the Group Algebraic System G decomposes into five smaller subsystems, each of which relate to well-known symbolic systems. Furthermore, by recognizing the algorithmic transformations between these subsystems, we can apply each representing a single component of the Group Algebraic System G, or model how algorithms are used in mathematics, by mapping its meaning onto the corresponding transformation steps between the subsystems. (...) Thus, we have transformed a Group Algebraic System G into five simpler subsystems (namely, symbolic analogic, lateral algebraic, calculus of infinity tensors, perturbations in waves, and algorithmic formation of symbols), each of which may also be represented algorithmically. This mapping process serves as a the basis for studying the algebraic machinery used in mathematics and logic to manipulate symbols, such as the classical logical systems or algebraic systems, using algorithms. (shrink)

Chaos topology delves into bizarre symbol configurations of the world of quasi-quantification and pseudo-quantifiability. With quantum complexes, we are eventually able to find game play that blends wormholes with quantum computers and transcendental numbers. A conclusion that will leave you breathless, Chaos (Emmerson, 2023),.

Standard Type Theory, STT, tells us that b^n(a^m) is well-formed iff n=m+1. However, Linnebo and Rayo have advocated the use of Cumulative Type Theory, CTT, has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α. In this paper, we set ourselves against CTT. We begin our case by arguing against Linnebo and Rayo’s claim that CTT sheds new philosophical light on set theory. We then argue that, while CTT ’s type-restrictions are unjustifiable, the type-restrictions imposed by (...) STT are justified by a Fregean semantics. What is more, this Fregean semantics provides us with a principled way to resist Linnebo and Rayo’s Semantic Argument for CTT. We end by examining an alternative approach to cumulative types due to Florio and Jones; we argue that their theory is best seen as a misleadingly formulated version of STT. (shrink)

Proceeding of the work in trivalent logic developped under the direction of the professor Hugo Padilla Chacón at the 90's at the National Autonome University of México. Program in RLisp.