English
Related papers

Related papers: Minimality Notions via Factorization Systems

200 papers

The concept of distance rationalizability of social choice rules has been explored in recent years by several authors. We deal here with several foundational questions, and unify, correct, and generalize previous work. For example, we study…

Computer Science and Game Theory · Computer Science 2016-10-07 Benjamin Hadjibeyli , Mark C. Wilson

Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or normalization theorems. In this paper we…

Logic in Computer Science · Computer Science 2019-11-28 Beniamino Accattoli , Claudia Faggian , Giulio Guerrieri

Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…

Quantum Physics · Physics 2018-08-09 Hamza Fawzi , Omar Fawzi

Recursive reasoning systems alternate between acquiring new evidence and refining an accumulated understanding. Two design choices are typically left implicit: how to represent the evolving reasoning state, and when to stop iterating. This…

Artificial Intelligence · Computer Science 2026-05-11 Debashis Guha , Amritendu Mukherjee , Sanjay Kukreja , Tarun Kumar

If $A$ is an n-by-n matrix over a field $F$ ($A\in M_{n}(F)$), then $A$ is said to ``have an LU factorization'' if there exists a lower triangular matrix $L\in M_{n}(F)$ and an upper triangular matrix $U\in M_{n}(F)$ such that $$A=LU.$$ We…

Numerical Analysis · Mathematics 2025-10-23 Pavel Okunev , Charles R. Johnson

In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the type of the languages and of the machines to categories that…

Formal Languages and Automata Theory · Computer Science 2017-11-09 Thomas Colcombet , Daniela Petrişan

The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and…

Category Theory · Mathematics 2024-10-07 David Ellerman

We take a utility-based approach to categorization. We construct generalizations about events and actions by considering losses associated with failing to distinguish among detailed distinctions in a decision model. The utility-based…

Artificial Intelligence · Computer Science 2013-03-08 Eric J. Horvitz , Adrian Klein

We propose a formal framework for understanding and unifying the concept of observers across physics, computer science, philosophy, and related fields. Building on cybernetic feedback models, we introduce an operational definition of…

Quantum Physics · Physics 2026-01-08 Hatem Elshatlawy , Dean Rickles , Xerxes D. Arsiwalla

Category Theory provides us with a clear notion of what is an internal structure. This will allow us to focus our attention on a certain type of relationship between context and structure.

Category Theory · Mathematics 2022-10-04 Dominique Bourn

We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…

Formal Languages and Automata Theory · Computer Science 2015-03-24 Paul Bell , Daniel Reidenbach , Jeffrey Shallit

We describe an equivalent formulation of algebraic weak factorisation systems, not involving monads and comonads, but involving double categories of morphisms equipped with a lifting operation satisfying lifting and factorisation axioms.

Category Theory · Mathematics 2022-12-16 John Bourke

We give a construction that identifies the collection of pure processes (i.e. those which are deterministic, or without randomness) within a theory containing both pure and mixed processes. Working in the framework of symmetric monoidal…

Quantum Physics · Physics 2018-03-05 Oscar Cunningham , Chris Heunen

In orthodox Standard Quantum Mechanics (SQM) bases and factorizations are considered to define quantum states and entanglement in relativistic terms. While the choice of a basis (interpreted as a measurement context) defines a state…

History and Philosophy of Physics · Physics 2024-04-24 Christian de Ronde , Raimundo Fernandez Moujan , Cesar Massri

We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category…

Category Theory · Mathematics 2023-06-13 Miloslav Štěpán

Rule based reasoning (RBR) and case based reasoning (CBR) have emerged as two important and complementary reasoning methodologies in artificial intelligence (Al). For problem solving in complex, real world situations, it is useful to…

Artificial Intelligence · Computer Science 2013-04-05 Soumitra Dutta , Piero P. Bonissone

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

Categorization systems are widely studied in psychology, sociology, and organization theory as information-structuring devices which are critical to decision-making processes. In the present paper, we introduce a sound and complete…

Logic in Computer Science · Computer Science 2017-07-28 Willem Conradie , Sabine Frittella , Alessandra Palmigiano , Michele Piazzai , Apostolos Tzimoulis , Nachoem M. Wijnberg

The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…

Neural and Evolutionary Computing · Computer Science 2022-10-13 Jerzy Szynka

Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical formulation of this problem, where operations on state-based…

Logic in Computer Science · Computer Science 2024-05-24 Mayuko Kori , Kazuki Watanabe , Jurriaan Rot , Shin-ya Katsumata
‹ Prev 1 4 5 6 7 8 10 Next ›