Generalizations of Laver tables

12/06/2018
by   Joseph Van Name, et al.
0

We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are self-distributive or where the operations satisfy a generalized version of self-distributivity. These algebras mimic the algebras of rank-into-rank embeddings E_λ/≡^γ in the sense that composition and the notion of a critical point make sense for these sorts of algebras.

READ FULL TEXT

page 8

page 9

page 12

page 13

page 15

research
02/20/2002

Nonmonotonic inference operations

A. Tarski proposed the study of infinitary consequence operations as the...
research
04/03/2019

A Polymatroid Approach to Generalized Weights of Rank Metric Codes

We consider the notion of a (q,m)-polymatroid, due to Shiromoto, and the...
research
05/25/2019

LUTNet: speeding up deep neural network inferencing via look-up tables

We consider the use of look-up tables (LUT) to speed up and simplify the...
research
07/31/2023

Canonical Gradings of Monads

We define a notion of grading of a monoid T in a monoidal category C, re...
research
03/01/2002

Deductive Nonmonotonic Inference Operations: Antitonic Representations

We provide a characterization of those nonmonotonic inference operations...
research
11/27/2021

Controlling the Correctness of Aggregation Operations During Sessions of Interactive Analytic Queries

We present a comprehensive set of conditions and rules to control the co...
research
04/14/2021

Eluder Dimension and Generalized Rank

We study the relationship between the eluder dimension for a function cl...

Please sign up or login with your details

Forgot password? Click here to reset