We explore a non-classical, universal set theory, based on a purely “structural” conception of sets. A set is a transfinite process of unfolding of an arbitrary (possibly large) binary structure, with identity of sets given by the observational equivalence between such processes. We formalize these notions using infinitary modal logic, which provides partial descriptions for set structures up t...

Monotone operators are of central importance in modern optimization and nonlinear analysis. Their study has been revolutionized lately, due to the systematic use of the Fitzpatrick function. Pioneered by Penot and Svaiter, a topic of recent interest has been the representation of maximal monotone operators by so-called autoconjugate functions. Two explicit constructions were proposed, the first...

In this paper we define Martin-Löf complexes to be algebras for monads on the category of (reflexive) globular sets which freely add cells in accordance with the rules of intensional Martin-Löf type theory. We then study the resulting categories of algebras for several theories. Our principal result is that there exists a cofibrantly generated Quillen model structure on the category of 1-trunca...

Abstract This paper is devoted to the examination of some socio-cultural dimensions of memory, focusing on narratives as a meditational tool (Vygotsky, 1978) for the construction of past events and attribution of meaning. The five elements of Kenneth Burke’s Grammar of Motives (1969) are taken as a framework for the examination of reconstructions of the past and particularly of histories, namel...

The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...

1. Introduction This study provides a computer-simulated optimal selection of antecedent of reflexive pronouns based on the Visual C++ computer programming language. The algorithm that I use for this implementation is based on the optimal theoretic approach to the proper interpretation of reflexive pronoun roughly adopted in Moon (1999). I show that the complex behavior of reflexive pronouns ca...

Let R be a commutative noetherian local ring that is not Gorenstein. It is known that the category of totally reflexive modules over R is representation infinite, provided that it contains a non-free module. The main goal of this paper is to understand how complex the category of totally reflexive modules can be in this situation. Local rings (R, m) with m3 = 0 are commonly regarded as the stru...

(including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations and their optimal approximation problem over generalized reflexive matrix solution (X1,X2, . . . ,Xq). When the general coupled matrix equations are consistent o...

Although much is known about volitional and reflexive smooth eye movements individually, much less is known about how they are coordinated. It is hypothesized that separate cortico-ponto-cerebellar loops subserve these different types of smooth eye movements. Specifically, the MT-MST-DLPN pathway is thought to be critical for ocular following eye movements, whereas the FEF-NRTP pathway is under...

A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U ⊆ V (H), then a vertex map f : U → V (G) is called nonexpansive if for every two vertices x, y ∈ U , the distance between f(x) and f(y) in G is at most that between x and y in H . A reflexive graph G is said to have the extension property (EP) if for every reflexive g...