🏠 No Place Like ~
Search
Search
Dark mode
Light mode
Explorer
Algorithmic Frontiers of Fairness
Algos when inputs are biased
Allocation Problem
Fair Division via Quantile Share
Fairly Allocating Goods, Chores and Mixed
FSTTCS Talks - Fairness
Matching with Fairness Constraints
Welfare Maximisation
Welfare Maximization - Provisioning Public Projects
College Notes
Excalidraw
Drawing 2025-01-07 12.06.37.excalidraw
FSTTCS
A class of rational trace relation closed under composition
A generalized quantum braching program
Acyclic Petri and Workflow Nets with Resets
Algorithms in the presence of Biased Inputs
bandwidth of Timed Automata
Causal Ingerence
Fitting Manifolds to data in presence of noise
From Concept Learning to SAT-Based Invariant Inference
Languages given by Finite Automata over the Unary Alphabet
Measuring Complexity
Random Path
Reachability Games and Friends
Regular Separators for VASS Coverability Languages
MOC
0-Atlas
Algebraic Automata Theory
Category Theory
Complexity Theory
Concurrent Programming
Conformance Checking
Data Structures
Descriptive Complexity Theory
Finite Model Theory
Games on Graphs
Homotopy Type Theory
IFPL Note Order
Independence of CH - Dana Scott
Infinite State Verification
Intro to Martingales
Logic
Logic, Automata and Games
Measure Theoretic Probability
Model Repair and Conformance Checking of Time Aware Models (MOC)
Module Theory
Revisiting Complexity of First-Order and Monadic-Second-Order Logic
Ring Theory
Set Theory
Software Verification and Analysis
Static Analysis
Topics in Algorithms
Topology via Logic
Undecidability in Algebra and Topology
Weighted Automata and Transducers
Notes
(Weighted) Vertex Cover using LP
+ is epxressible in FO(BIT, <)
1-Forms
2-Categories
2-Way DFA
2DFAs are equivalent to DFAs
17th Jan LAG lecture
21st Nov Class Dump AAT
22 Oct AAT
24th October Classwork
25th October stuff
29th LP Notes
2023-04-11
2023-04-13
A better Axiom of Choice for Type Theory
A Categorical notion of Equivalence Relation
A complete, locally small category with a jointly weakly initial set of objects has an initial object
A Fiberwise Transformation is an Equivalence if its Total is an Equivalence
A functor admits a left adjoint iff all its comma categories have an initial object
A Language if Regular iff its Characteristic Function is regular
A locally small, complete category with a small coseparator and intersections of all collections of subobjects has an initial object
A More Efficient Method for Petri Net Coverability
A natural isomorphism between diagrams induces an isomorphism between limits and colimits
A Poset is a complete and cocomplete category iff it is a complete lattice
A Proof System for FOL
A Simple Example - cat theory 1
Abelian Groups
Absoluteness of Formulas
AC0
Acyclicity of Graphs is Definable in LFP
Adal week 3
Addition is Associative (Type Theory)
Adjacency Algebra of a Graph
Adjoint Functor Theorem for locally presentable categories
Adjoints of Inclusion functor from Ring to Rng
Adjunction of Bifunctors
Adjunctions
Adjunctions in Functor Categories
Adjunctions in Posets
Affirmative and Refutative Assertions
Alg3 class
Algebraic Classification of Recognizable functions
Algebraic Closure
Algebraic Extension
Algebraic Integers
Algorithm for Arborescence
Algorithm for Finding the Weight of a Word
Algorithmic Coding Theory Lec 1
Almost All Automorphism Groups are Trivial
Almost certain model checking
Alt
Alternating Finite Automaton
Alternating Timed Automata
Alternating Turing Machine
Amdahl's Law
Analytic Function
Anderson's Lock
Another way to Complement a Büchi Autromata
Any Category with Coproducts and Coequalizers is Cocomplete, with Products and Equalizers is Complete
Any category with Pullback and a terminal object has all finite limits, with pushouts and an initial object has all finite colimits
Any Equivalence can be promoted to an Adjunction
Aperiodic Languages are Star Free Regular
Aperiodic Monoids recognize all FO Definable Languages
Application in Error Correcting Codes
Application of Static Analysis
Applications of Error Correcting Codes
Approximation Algorithms
APX (Complexity Class)
Arborescence
Arc-Transitivity and diameter
Arc-Transitivity and Girth Relation
Arc-Transitivity of a Graph
Arden's Lemma
Arenas for Games on Graphs
Arithmetic Operators are Definable in LFP
Arrow Type
Ascending Chain Condition
Associates in Rings
Asymmetric Graphs
Atomic Types
Atomization of Programs
Automorphism Group of a Graph
Autonomous System
Axiom of Choice and its Variants
Axiom of Constructibility
Axioms for Higher Order Theory of Reals
Axioms of ZFC
Axioms Satisfied in M[G]
Backoff Lock
Banach-Mazur Games
Based Path Induction
Bases for a topology
Basic Feasible Solution
Basic ways to prove things using coq
Bi-invertible Maps
Big Software Fails
Bijective Ehrenfeucht-Fraïssé Game
Binary Heaps
Binomial Heaps
Bipartite Expander Graphs
Bipartite Graph Perfect Matching
BIT is expressible in FO(+, *)
Block-Graph Theory
Boolean Algebra
Boolean Circuits
Boolean Type
Borel Sigma Field
Borel's Law of Large Numbers
Borsuk Ulam Theorem
Boruvka's Algorithm
Both Directions of Half Adjoints are Logically Equivalent
Bounded Number of Degrees Property
Bounded Wait-freeness
BPP Complexity Class
Britton's Lemma
Brouwer's Fixed Point Theorem
Büchi Automata
Büchi Automata for Linear Temporal Logic
Büchi Automata for Monadic Second Order Logic
Building of Assignment Tester
Burnside's Lemma
Calc - Problem Session - 7 Oct
Calculus Assignment
Caley Graphs
Can there be sparse sets that are NP-hard?
Cana Assignment 4
CANA-HW-4
CANA-HW-5
Cannonical Decomposition of Module Homomorphisms
Cannonical Decomposition of Ring Homomorphisms
Cardinal Arithmetic
Cardinality of a small category
Cardinals
Cardinals Pre-reqs
Cartesian Closed Category
Cat and CAT are complete and Cocomplete
Categorization of Equivalent Categories
Category
Category of Abelian Groups is closed
Category of Compactly Generated Hausdorff Spaces is CCC
Category of Modules
Category Theory Introduction Page
Cauchy-Reimann Equation
Cayley-Graph-Examples
Cesaro Summability
Chain Complex
Channel Systems
Characterisic of a field
Checking if a word is related to Sigma*
Choosing Limits of diagrams in Functorial
Church Booleans
Church Numerals
Church-Style typing
Circle (HoTT)
Circuit Value Problem
Circulant Graphs
CLH queue Lock
Closed Category
Closed sets
Closure and Atoms for Büchi construction of LTL formulas
Closure and Interior and Limit Points
Closure of a set under a set of functions
Closure Properties of Büchi Automata and Omega-regular languages
Closure Properties of Rational Relations
Closure Properties of Recognizable functions
Co-NP (Complexity Class)
Cofinality
Coherence Spaces
Coherence Types for Equivalences
Coin Example
Colimit of Limits gives Limit fo Colimit of a Bifunctor
Combinatorial Proofs
Combinatorial Optimisation
Combinatory Logic
Combined Complexity of a Logic
Communication Free Petri-Net
Commutative Ring
Commuting of Rectangles and Squares
Compactness
Complete and Cocomplete Categories
Complete Lattice
Complete or Cocomplete k-small categories are pre-order
Complete problem for NL
Completion of a Measure Space
Complex Analysis Assignment 3
Complex Convergence Results
Complex Numbers
Complex Numbers as quotients of polynomial ring over Reals
Complex Polynomials
Complex Rational Functions
Complexity Assignment 1
Complexity Assignment 2
Complexity Assignment 3
Complexity Classes
Complexity of FO
Complexity of FO(Cnt)All
Complexity of KKT Algorithm
Complexity of Model Checking in Monadic Second Order Logic
Complexity of MSO
Complexity of MSO over Bounded Tree-Width Structures
Composite Field
Composition of Adjunctions
Composition of Sequential Transducers
Computable and Uncomputable Functions
Computation Tree Logic
Computational History
Computing m_q
Concrete Categories
Concurrent Registers
Conditional Expectation
Cones and Cocones
Cones and Suspensions (Topology)
Conformality Transformation on let(rec) expressions
Conjugation Problem on a Free group
Connectedness
Connectivity is not EMSO definable but is AMSO
Connectivity is not FO Definable
Connectivity is not FO definable for Finite Graphs
Consensus
Consensus Number for Compare and Set - Omega
Consensus Number of Atomic Read Write Registers - 1
Consensus Number of Atomic Read Write Registers and Atomic Queue - 2
Constant Pattern to Lambda Calculus
Constructable Sets
Constructible Numbers
Constructing the Free Group
Constructing the Left Adjoint of Inclusion Functor from Ring to Rng
Construction of Syntactic Monoid of an Automata
Constructor Rule for Match Function
Continuous and Cocontinuous Functor
Continuous Functions
Continuum Hypothesis
Contractible Fibers
Contractible Types
Convergence of a Sequence of Martingles
Convergence of Fourier Series
Converting Case Expressions to Ordinary Lambda Calculus
Converting Enriched Lambda Calculus to Ordinary Lambda Calculus
Convolutions
Cook-Levin Theorem
Coproducts in Category Theory
Coq Basics
Corollaries of RAPL
Correspondence of Topological and Probabilistic Semantics for LTL
Countably Compact
Counter Automata
Counting and Locality
Coverability in Petri Nets is Decidable
Covering Spaces
CTL*
Curry Howard Isomorphism
Curry-Style typing
Cyclically Reduced Term
Cyclotomic Fields
D-Timed Automata to Timed Automata Construction
Data Complexity of a Logic
Deadlock-freeness
Decidability (HoTT)
Decidability of Finitely Satisfiability and Validity
Decidability of Presburger Arithmetic
Dedekind Domains
Definable Formulas
Definable Formulas are Countable
Definable Power Set
Definablity of Even Atoms
Deformation Retracts
Degree of a Structure (FMT)
Delta0 Formulas
Denotational Semantics for lambda Calculus
Dependency analysis for letrec expressions
Dependent Function Type
Dependent Pair Types
Dependent Types
Determinants
Deterministic Rabin Automata accept omega-regular languages
Deterministic Timed Automata
Diagonal Constraints Offer Exponential Succinctness.
Diagram
Dice Example
Diff Eq - Nice Info
Dimension of a Path
Dinic's algo for max-flow
Dinur's Theorem
Direct sum of Modules
Dirichlet Kernels
Discriminant of an n-tuple
Distance Functions for Timed Traces on Petri Nets
Distance of a Code
Distances in Graphs
Division Ring
Doob Decomposition Theorem
Doob's Martingale Convergence Theorem
Doob's Maximal Inequality
Doob's Upcrossings Inequality
Double Negation Does Not Cancel
Double on Natural Numbers using W-Types
DTIME(f) Complexity Class
Dual Vector Space Example
Duality
Duality Theorems for LP
Dualling Both Categories in an Adjunctions
Eckmann-Hilton
Edge-Transitive, Non Transitive is Bipartite
Edmond's algorithm for general Matching
Edmonds-Karp algo for max flow
Ehrenfeucht-Fraïssé Game
Ehrenfeucht-Fraïssé Game for MSO
Ehrenfeucht-Fraïssé Games Proof
Ehrenfeucht-Fraïssé Theorem
Element Category
Element Category is Isomorphic to Comma Category
Elementary Functions
Ellipsoid Algorithm
Emptiness for Updatable Timed Automata
Emptiness Of Support
Empty Rule for Match Function
Emulating a Multi-tape Turing machine on a Single Tape Turing Machine Effeciently
Encoding and Decoding Functions
Encoding Finite Model
Encoding for Proposition Formulas
Encoding of Tuples
Endsem ACT
Enriched Lambda Calculus
Enumeration Machine
Epimorphisms and Monomorphisms of Exact Sequences
Equality in Tropical Weighted Automata
Equality of Semigroups
Equalizers and Coequalizers
Equational form of LP
Equations over Finite Fields
Equivalence between Machines
Equivalence Induction
Equivalence of Categories
Equivalence of Definitions of Universal Property
Equivalence of more complicated structures - Semi-groups
Equivalence of Rational Relations is Undecidable
Equivalences Reflect, Preserve and Create Colimits
Equivalent Definitions of Adjuctions
Equivalent Definitions of Well-preorder
Error Correcting Codes
Error Reduction for RP algorithms
Evaluating Pattern Matching in Lambda Calculus
Even Atoms in Boolean Algebras
Even is (MSO + <)-expressible
Even is not FO-definable for Linear Orders
Even is not MSO-expressible
Event Clock Automata
Event Predicting Automata
Event Recording Automata
Every Finite Semi Group has an idempotent element
Exact Sequences
Example for Proof System in FOL
Examples for W-Types
Examples of Adjunctions
Examples of Categories
Examples of Coequalizers
Examples of Element Categories
Examples of Equalizers
Examples of Equivalence of Categories
Examples of FO(Cnt)
Examples of Free-Forgetful Adjoint Pairs
Examples of Functors
Examples of Matroids
Examples of Modules
Examples of Mutual left and right adjoints
Examples of Natural Transformation
Examples of Natural Transformation with Representable Functor as Domain
Examples of Pullbacks
Examples of Pushouts
Examples of Reflective Subcategories
Examples of Representable Functors
Examples of Representable Universal Property of Colimits
Examples of Rings
Examples of Sets in Type Theory
Existence and uniqueness for linear systems
Existence of Gomory-Hu trees
EXP (Complexity Class)
Expander Graphs
Expander Graphs and Applications
Expander Mixing Lemma
Exponential Generating Functions
Exponential of a Matrix
Expressability of One-Clock Alternating Timed Automata
Expressing Transitive Closure with Fixed Points
Expression Complexity of a Logic
Expressive Power Of Event Clock Automata
Expressive Power of Gödel's system T
Extending FO
Extension Field
Extension of Proper Filter to Prime Filter in Heyting Algebras
Exterior Algebra
Exterior Differentiation
Extrapolation for Zone Automata
Factorization Forest Theorem
Fagin's Theorem
Failure of CH in a suitable Model
False Assumptions easy to make about Patterns
Farkas' Lemma
Fejer Kernel
Fiber of first projection of Sigma Types
Fibers (HoTT)
Fibers of Half Adjoint Equivalences are Contractible
Fibonacci Heap
Field (Measure Theory)
Fields
Filter Lock
Filtered Category
Filtered Colimits commute with finite limits in Set
Filtered Probability Space
Filters
Filters in Heyting Algebras
Filtrations (Measure Theory)
Finding the Downward Closure of Some Languages
Finite Essentially Uninterpreted (FEU) fragment
Finite Fields
Finite Integral Domains are Fields
Finite Intersection Property
Finite Monoids and idempotent elements in big words
Finite Sat for FOL
Finite Sat for FOL Motivation
Finite Type Algebra
Finite Variable Logics
Finitely Satisfiable and Valid Sentences
First Countable space
First Order Logic
Fixed Parameter Tractibility
Fixed Point Logics
Fixed Point Logics are subsumed by Finite Variable Logics
Fixed Points
FO for Verifying CNF Encoding
FO on Finite Words accepts Star Free Languages
FO Queries are Hanf Local
FO with Infinitary Connectives
FO(+, *)
FO(All)
FO(All) is in AC0
FO(Cnt)
FOL Inexpressibility
FOL-Examples for Definability
Forbidden Ideal of an element in a Monoid
Forgetful functor from comma category strictly creates limits
Forgetful Functors that do not have an adjoint
Formal Description of a 2-DFA
Formalising Precision and Fitness for Time Petri Nets
Forward Reachability Tree
Fourier Series
Fourier series is the best approximation
Fractional Tree Packing
Fragments of Second Order Logic
Frames(Algebra)
Frechet Property
Fredmen and Tarjan's Algorithm
Free Abelian Group
Free Algebra
Free Category on a Directed graph
Free Group
Free Module
Free Monoid
Freyd's Representability Theorem
Fully Faithful Functors and Adjunctions
Fully Faithful Functors Reflect Limits and Colimits
Function Type
Functions as Equivalences
Functions as Functors
Functions as Functors of 2 Category
Functions Computable in Lambda Calculus
Functions types to isomorphic types are isomorphic
Functor Categories inherit Limits and Colimits object-wise
Functors
Fundamental Group
Fundamental Groupoid
Gaifman Graph
Gaifman Theorem
Gaifman-Locality
Gaifman-Locality implies BNDP
Galois Correspondence
Galois Extensions
Game for Counting Logic
Gameplay for Games on Graphs
Games of Graphs with Fixed Points
Gauss sums
General Adjoint Functor Theorem
Generalized Steiner Tree-Forest Problem
Generating Effects
Generating Functions
Generic Extensions of Set Theory Models
Generously Transitive
Geometric Propositional Logic
Gödel's system T
Good Kernels
Good Samaritan vs the Minimally Decent Samaritan
Graph Connectivity is not Hanf-Local
Greedy Cost Bounded Model Repair for Sequential Time Petri Nets with Delay Only Distance
Green's Lemma
Green's Relations
Green's Theorem
Group Testing problem
Group-Free Semi-group
Groupoids
Groups In First Order Logic
Gurevich-Shelah's Theorem
Guruswami-Sudan's list decoding of RS codes
Half Adjoint Equivalences
Half Adjoint Equivalences are Mere Propositions
Hamming Bound
Hamming Codes
Hamming Distance
Hanf-local Queries are Gaifman-local
Hanf-Locality
Hardness of LTL Model Checking using Timed Automata
hat V- Deterministic Büchi Automata
Hausdorff Property
Hereditarily Finite Sets
Heyting Algebra
Higher Groupoid Structure of Cartesian Product
Higher Groupoid Structure of Identity Types
Higher Groupoid Structure of Natural Numbers
Higher Groupoid Structure of Pi Type
Higher Groupoid Structure of Sigma Type
Higher Groupoid Structure of Unit Type
Higher Groupoids Structure of Coproducts
Higher Inductive Types
Higman's Lemma
Hilbert's Basis Theorem
Hilbert's cube
History(Concurrent Programming)
HNN - Extensions
Hoare Logic
Homeomorphisms
Homework 1
Homework 2
Homogenous Linear Systems
Homology
Homology as generalization of Kernel and Cokernel
Homology Theory
Homotopy Equivalence
Homotopy Group
Homotopy Induction
Homotopy Inductive Types
Homotopy of paths
Homotopy(HoTT)
Hover Operator (Verifiction of MST)
How to count
IC3 Algrorithm
Ideals
Ideals in a Monoid
Ideals in Quotients
Identity Functor admits a limit iff there is an initial object
Identity is an Equivalence
Identity System
Identity System at a point
Identity Type
Identity Types form an Inductive Family
If C is Complete and Cocomplete, so are the slice and coslice categories over C
If R is a PID then submodules of free module over R are free
If R is noetherian and M is finitely generated then M is noetherian
IFPL Lec 2
Image of a Regular Language under a Sequential Transducer is Regular
Immerman–Szelepcsényi Theorem
Immerman–Vardi's Theorem
Implementation of Sets and Set Operations
Inapproximability of Max Independent Set
Incidence Matrix
Increasing Upward-Closed sets in Preorders
Independence of meaning from changing the order on the left hand side implies uniform definition
Inductive Types
Inductive Types are Initial Algebras
Infinte product and coproduct of modules do not coincide
Inhomogenous Linear Systems
Initial, Terminal and Zero Objects
Integers in Simply Typed Lambda Calculus
Integral Curves
Integral Domain
Integrality Gap
Integration (Measure Theory)
Intermediate Value Theorem
Interval (HoTT)
Interval implies Function Extensionality
Interval is Contractible
Intuitionistic Logic
Invariant Queries
Inverse Limits and Direct Limts
INW generator for Space Bounded Computation
Irrefutable let(rec)
Irrefutable let(rec)s to Simple let(rec)s
Isolating Cut Heuristic for Multicut Problem
Isomorphism Between First Order Interpretations
Isomorphism Types of Models
Isomorphisms (Category Theory)
ISV lec 3
Jacobi Sums
Job Scheduling Problem
Johnson Graphs
Joint Distribution Measure and Product of Probability
Karger, Klein and Tarjan's Algorithm
Karger's min-cut algorithm
Karp-Lipton Theorem
Kernel and Cokernels in R-Mod
Kernels and Cokernels
Kleene Shutzenberger Theorem
Knaster-Tarski Theorem
Kneser Graph
Kolmogorov Property
Kolmogorov Translation
Kolmogorov's Law of Large Numbers
Kolmogorov's One Series Theorem
Kripke Models
Kripke Models are Equivalent to Heyting Algebra
Krull Dimension
Kruskal's Algorithm
L is a model of ZF
L is a Model of ZFC
L is a Model of ZFC + GCH
L Rank of a constructible set
L_infty,omega star
l,k Ajtai-Fagin Game for EMSO
L* example
L* Learning Algorithm
Ladner's Theorem
LAG 4 May
Lambda Calculus Evaluation Rules
Lambda Calculus Introduction
Lambda Calculus Syntax
Lambda Mu Calculus
Lambda Term In Combinatory Logic
Lamport's Bakery Lock
Language of Infinite words
Language Operations on Monoids
Largest common independent set of a matroid
Last Appearance Record
Lattice
Lattice Graphs
Lebesgue Number Lemma
LECTURE
Lecture local fields
Left and Right Adjoints are Unique
Left and Right Inverses
Left and Right Inverses of Ring Homomorphisms
Legendre Symbol
Lemma 1 for Complementation of omega-Regular Languages
Lemma 1 for Quasi-inverse is not a Mere Proposition
Lemma 2 for Complementation of omega-Regular Languages
Lemma 2 for Quasi-inverse is not a Mere Proposition
Lemma 3 for Complementation of omega-Regular Languages
Lemma for BEF Games
Lemma for H-smooth Words
Lemma for J-smooth words
Lemma for Minimax Theorem
Lemma for Natural Number Encoding
Lemma for R-smooth Words
Lemma for Threshold Equivalence
Lemma-Number of isomorphism classes on graphs
let-expressions in Enriched Lambda Calculus
letrec-expressions in Enriched lambda Calculus
letrec-expressions to Irrefurtable let-expressions
LFPsimult = LFP
Lifted Reed Solomon Codes
Lifting Correspondence
Lifts
Limits and Colimits
Limits and Colimits as Adjunctions
Limits and Colimits in multiple variables can be taken in any order
Limits in the Category of Sets
Lindelof Space
Lindenbaum-Tarski Algebra
Line Graph
Line Integral
Linear Algorithm for Special case of TPMP
Linear Programming
Linear systems with constant coefficients
Linear Temporal Logic
List decoding Folded RS
List decoding RS codes up to the Johnson radius
Local Compactness
Local Connectedness
Local Correcting and Decoding of RM codes
Local Decoding
Local Equivalence
Local Equivalence Lemma
Local Path Connectedness
Local problems on codes
Local Self-correction of Bivariate Multiplicity Codes
Locality (Finite Model Theory)
Locally Finite and Summable Series
locally presentable categories
Locally Small and Complete Categories with a small coseparating set where all collections of subobjects of a fixed object have an intersection then it is cocomplete
Locally Small, Complete category with a small coseparator where all collections of subobjects of an object have an intersection has all continuous functors form it be representable
Location Lemma
Logic L capturing the complexity class K
Logic, Regular Languages and Languages Recognized by Monoids
Loop is not refl
Loop Space
Los-Vaught Test
Lovasz Local Lemma
Löwenheim-Skolem and its Variants
Lower Bound on Shared Process
LP algorithm for Bipartite Matching
LP algorithm for general Perfect Matching
LP Solution examples
LTL vs CTL
M is noetherian if for every sub-module N, N and MN are noetherian
Machinery for Probabilistic Semantics for Timed Automata
Machines Realising Rational Functions
Martingale Transform
Martingales
Match Function for Enriched Lambda Calculus
Matching Problem
Matroid Intersection
Matroids
Max wt base of a matroid
Maximal Traces for Linear Time Petri Nets for Delay Only Distance
Mealy Machines and Moore Machines
Measurable Functions
Measure Space
Measurement of Redundancy in a code
Mere Propositions
Mere Propositions are Sets
Metric Topology
Metrizable Spaces
Miller-Rabin Algorithm for Primality
Minimax Theorem for Zero-Sum Games
Minimizing a Weighted Automata
Minimum k-cut Problem
Minimum Spanning Trees
Mixed Nash Equilibrium
Mixed Strategies
Mixture Rule for Match Expression
Model Checking of CTL formulas
Model Repair and Conformance Checking of Time Aware Models
Modular Machines
Modular Machines are Turing Complete
Modules
Monadic Second Order Logic
Monoid Homomorphisms
Monoid Ring
Monoidal Category
Monoidal Closed Category
Monoids
Monoids as Idempotent Commutative Langauges
Monoids as Languages
Monoids as Regular Languages
Monolithic Timed Automaton for a Network of Timed Automata
Monomials, Polynomials and Series
Monomorphisms and Epimorphisms
Monomorphisms and Epimorphisms in Rings
Monotone Domination Order
Monotone, Inflationary and Inductive Functions
Monotonicity is Undecidable
Motivation for Concurrency Theory
Motivation for Games
MSO has Problems in each PH level
MSO on Finite Words accept Regular Languages
MSOL(lt) equivalent to MSOL(succ)
MTP 17-09-24
Mu-Recursion
Multi-choose
Multi-way Cuts
Multiplicative Characters
Multiplicity Automata
Multiplicity Codes
Multiset
Multivariate Polynomial Interpolation on Lines
Mutual Exclusion
Mutual Left and Right Adjunctions
Myhill Nerode Theorem
N is the initial object in the category of N-Algebras
N_L admits Quantifier Elimination
Naive Algorithm for Reachability in Zone Automata
Natural Deduction
Natural Numbers in Type Theory
Natural Numbers with Successor
Natural Numbers with Successor and Ordering
Natural Numbers with Successor Function is Complete
Natural Transformation
Neighborhood (Finite Model Theory)
Network Flows
Network Reliability
Networks of Timed Automata
Newman's Lemma
Nivat's Theorem
Noetherian Modules
Noetherian Ring and PIDs
Non deterministic Space Hierarchy Theorem
Non deterministic Time Hierarchy Theorem
Normal Extensions
Normal Spaces
Normalization Theorem for Gödel's system T
Normalizing a Transducer
Not Unification Algorithm For Type Inference
Notes
NP (Complexity Class)
NP Complete
NTIME(f) Complexity Class
Number Field
Number Of Roots and Poles of a Rational Function
Number Rings
Object Classifiers
ODE
Olog
omega-Automata
Omega-Regular Languages
One Parameter Group Of Diffeomorphisms
One Point Compactification
Open and Closed Functions
Operations on Integrals
Opposite Category
Optimal Reachability in Weighted Timed Games
Optimality of Basic Feasible Solution
Optimisations for Expressions containing FAIL and Fatbar
Optimisations for Overlapping Patterns
Orbits in X x X being strongly connected under transitive automorphism
Orbits on X and X x X
Order Invariant FO
Order Invariant FO(Cnt) is not Gaifman Local
Order Topology
Ordered Fields
Ordered Fields and Archimedean Axiom
Ordering between Axiomatic Theories
Ordering Equations in Uniform Definitions
Ordinal Definable Sets
Ordinary Generating Functions
Owing to a Person vs Them having a Right against you
P (Complexity Class)
P implies not-not P - Intuitionistic Logic
P-adic Solenoid
P-Generic classes
P-name
Pairs in Lambda Calculus
Partial Functions
Partial Isomorphism
Path Connected Component Functor
Path Connectedness
Path Induction
Paths on Graphs and Finite Variable Logics
Pattern Matching to Ordinary Lambda Calculus
Patterns
PCP'
Peano Axioms and Type Theory
Pebble Games
Perfect Fields
Permutation Matrix Theorem
Phase Flow
Phase Space
PLC Assignment 3
Pointed Predicates and maps
Pointed Type
Polynomial and matrices over semi rings form semi rings
Polynomial Rings
Polynomial Rings over a Noetherian Ring are Noetherian
Polynomial-Time Hierarchy
Polytime Approx Algo for Steiner Trees
Positive Formulas
Post Correspondence Problem
Power Series
Pre-Image of a Regular Language under a Sequential Transducer is Regular
Predicable Process
Prefix Preserving
Preorder
Presentation of a Group
Preservation, Reflection and Creation of Limits
Prim's Algorithm
Primal - Dual LP
Primal-Dual Algorithm for Bipartite Min-cost Perfect Matching
Primal-Dual Algorithm for general Min-cost Perfect Matching
Prime and Irreducible elements
Prime elements are irreducible
Prime Ideals and Maximal Ideals
Prime Ideals are Maximal in PIDs
Primitive Element Theorem
Primitive Recursion
Primitive Transitive Permutation Group
Principle Ideals
Probabilistic Automata
Probabilistic Semantics for LTL
Probabilistically Checkable Proof
Probability
Probability Measure over Finite Paths in a Timed Automata
Probability Theory and Gambling
Product Constructor Pattern Matching to Lambda Calculus
Product in Category Theory
Product Measures
Product of Well-Preorders
Product topology
Product Type
Product Type(HoTT)
Products and Coporducts
Products in Rings
Products in Topology from Products in Category Theory
Products respect Universal Properties
Program for RAM
Proof by Induction in Coq
Proof for Lower Bound on Shared Processes
Proof for Reflection Theorem
Proof for the Undecidability of the Word Problem
Proof that L2 cannot be accepted by a 1 Clock Timed Automata
Properties of Karp-Miller Trees
Properties of Minimum Spanning Trees
Properties of the Attractor function and Traps
Propositional Resizing
Propositional Truncation
Pseudocode for CLH queue Lock
PSPACE
PSPACE-Hardness of LTL Model Checking
PTAS (Complexity Class)
Pullbacks and Pushouts
Pullbacks in CAT
Pure Sequential Transducers
Purely Timed Alignment Problem for Linear Time Petri Nets for Delay Only Distance
Push Down Automata
Pushouts in CAT
Quadratic Reciprocity
Quanitifier Elimination for Natural Numbers With Successor
Quantified Boolean Formulas
Quantifier Rank
Quantifier rank
Quasi-inverse is not a Mere Proposition
Queue Based Locks
Quotient Rings
Quotient Topology
Quotienting by monic polynomial is an abelian group isomorphism with direct sum
Quotients in Monoids
Quotients of Polynomial Rings
Quotients of Syntactic Monoid of a language
R with Lower Limit topology
R_K
R-Mod is a CCC
R^w
Radon-Nikodym Theorem for Countably Generated Sigma Field
Ramsay's Theorem
Random Access Machines
Randomised or Probabilistic Computation
Randomized Algorithms
Rank of a module
Rank-k m,l Types MSO
Rank-k Types (FO)
Ranked Tree Automata
Ranked Trees in Logic
RAPL
Rational Functions (Weighted Automata)
Rational Relations as Weighted Automata
Rational Series
Rational, Automatic and Recognizable relations
Reachability Algorithm for Zone Automata
Reachability in Finite Pushdown VASS
Reachability in Lossy Channel Systems
Reachable Vectors
README
Recursive and Recursively Eumberable Sets
Reducibility
Reducibility Theorems
Reducing a Weighted Automata
Reduction
Reflection Theorems
Reflective subcategories create limits and contain colimits
Reflective Subcategory
Region Automata Alternate Definition
Regular Permutation Groups
Regular Spaces
Regular Tree Languages
Relative Strength of ZF- and ZF
Removable Singularities in Analytic Functions
Repeated Events
Representable Functors
Representable Functors Define Representing Objects
Representable Matroids
Representable Universal Property of Colimits
Representable Universal Property of Limits
Representation of Limits and Colimits as Limits in category of sets
Residuals using Longest Common Prefixes
Result of Expressive Power of Gödel's system T
Retract of an Equivalence is an Equivalence
Retractions
Retracts (HoTT)
Right Congruent Equivalence Relation
Ring
Ring Homomorphisms
Rules for Higher Inductive Types
Runtime
S^1
Sankalp Talk - Ax Grothediek Raw
Satisfiability in First Order Logic
Savitch's Theorem
Scientific Data Science
Search vs Decision for NP complete problems
Second Countability
Second Order Logic
Semantics for CTL
Semantics for LTL
Semantics of First Order Logic
Semaphores
Semi Groups in Types Theory
Semi Ring
Semi-Groups
Semi-Modules
Semifield
Separable Extensions
Separable Polynomials
Separable Spaces
Separating and Coseparating sets
Separation Axioms
Separation Oracle for perfect matching LP
Sequent Calculus
Sequential Transducers
Sequentially Compact
Set Cover Problem
Set is Complete
Set is Complete and Cocomplete
Set of Languages accepted by Büchi Automata are exactly Omega-Regular
Sets in Type Theory
Short Exact Sequences
Shortest Path using Primal-Dual
Showing a Point is Isolated is Undecidable
Sigma Field
Sigma Types respect Universal Properties
sigma-paradise
Similar description of inductive types lead to equal types
similar tunes
Simple let expressions to Ordinary Lambda Calculus
Simple Regular Expressions
Simplex Method
Simplicial Complexes
Simply Connected
Simply Typed Lambda Calculus Syntax
Simulation for Zone Automata
Simultaneous Fixed Points
Simultaneous Unboundedness Problem
Size of subsets of Reals
Slice Category Strictly Creates Limits
Slide Plan
Small Progress Measures
Small Categories
Small Limits in Set are Equalizers
Small Tree Decomposition
Small Tree Decompositions are Small
Smallest Filter Heyting Algebras
Snake Lemma
Solution of a differential equation
Solution of an LP
Solving a First Order ODE
Solving a linear differential equations
Solving SAT using MSO
Some Algorithms for finding the Minimum Spanning Trees
Some Applications of Kripke Structures
Some Contractible Types
Some Generalization of Inductive Datatypes
Some Problems in Computational Algebra
Some Type Formers respect Mere Propositions
Some Useful Inequalities
Some ways to Characterize Homotopy W types
Sparse recovery-compressed sensing
Special Adjunct Functor Theorem
Special Case of Tree Path Maxima Problem
Special Types of Measures
Specifying a Type
Spectrum of a Cube Graph
Spectrum of a Ring
Spectrum of The adjacency Matrix
Spectrum of the complement of a graph
Spectrums in PIDs
Sphere (HoTT)
Spin Locks
Split Exact Sequences
Splitting Fields
Splitting of Primes in extensions
Spooky Day Logic stuff
Stable Subsemodule of Series
Stage Comparisons
Stages(Finite Model Theory)
Star Free Regular Languages are Aperiodic
Star Free Regular Languages can be accepted by FO on words
Starvation-freeness
Steiner Trees
Steiner Trees are NP Complete
Steinhaus Random sign problem
Stochastic Languages
Stochastic Languages are Regular if Threshold Point is Isolated
Stochastic Languages are Undecidable in General
Stoke's Theorem
Stone Cech Compactification from Special Adjunct Functor Theorem
Stone's Representation Theorem
Stopping Time
Strategy for Games on Graphs
Streams as Frames
Streams as Frames Alt
Strictly Creating Limits
Strings in Logic
Strong Normalization Theorem
Strongly Regular Graphs
Structure Preserving Maps
Sub-basis
Sub-Games
Sub-Types
Submodule and quotients
Subobjects
Subset Relation between Timed Regular Languages
Subset Sum Problem
Subspace Topology
Successor invariant FOL on finite structures
Succinct Encoding of Natural Numbers Using Strings
Sum Constructor Pattern Matching to Lambda Calculus
Sum of all Fibers of a Function is the Domain
Sum off all Functions from all types are equivalent to a type family
Sum Types
Support of an Automorphism on a Graph
Surjection and Embedding are equivalent to Equivalences
Surjections and Embeddings
Suspensions (HoTT)
SVA Assignment 0
SVA Assignment 0 part 4
SVA Staggered Problems
Syntax of First Order Logic
System of First Order Differential Equations
T-Transitiviy of Graphs
TAS Lock
Temporal Logic
Tensor Products as Universal Properties
Tensors
Textbook review 8 math
The Category Ring
The fundamental theorem of Galois Theory
The matching polytope has exponential extension complexity
The Principle of Unique Choice
The Riemann Sphere
Theorem- Bipartite Graph Eigen Value Pairs
Theorems about Stopping Times
There is a non-trivial proof for reflexivity of equality in Circle
Threshold Equivalence
Threshold Languages
Tietze Extension Theorem
Time and Space Hierarchy Theorems
Time Petri Net
Time Table Planning
Timed Automata Alternate Definition
Timed Automata Homework 1
Timed Automata Plan
Timed Automata with Diagonal Constraints
TOC Problem Set 1 (not graded)
Top is Complete and Cocomplete
Topological Groups
Topological Invariants
Topological Semantics for LTL
Topological Space of Paths in a Timed Automata is Baire
Topological Spaces
Topological Spaces as Frames
Topology over Finite Paths in a Timed Automata
Torsion submodule
Total Spaces (HoTT)
Total Unimodularity
Trace and Norm
Traces of Powers of Adjacency Matrices
Train Track Crossing for Timed Automata
Trakhtenbrot's Encoding of Turing Machine
Trakhtenbrot's Theorem
Transitive Sets
Translating Haskell Programs to Lambda Calculus
Translation Scheme from Haskell to Lambda Calculus for Definitions
Translation Scheme from Haskell to Lambda Calculus for Expressions
Translation Scheme from Haskell to Lambda Calculus for Some RHS only options
Transport
Transport over a function between families
Transports in a Family of Paths
Transpose of a Weighted Automata
Travelling Salesman Problem
Tree Decomposition
Tree Decomposition and Size of the Tree
Tree Decomposition Lemma 1
Tree Decomposition of k-connected Graphs
Tree Packing
Tree Path Maxima Problem
Tree Width
Trees (Automata Theory)
Triangular Graphs
Trigonometric Functions
TTAS Lock
Tube Lemma
TUE 7 Lec Notes
Turing Machine Configuration
Turing Machines
Turing Machines with multiple tapes
Two Stacks
Two Variable Adjunction
Two-Way Infinite Tape Turing Machine
Tychonoff's Theorem
Type Inhabitation in P-SPACE
Type of a Set and a Relation
Type of Natural Number Algebra
Type of W-Algebras
Type Theoretic Axiom of Choice
Type Theoretic Rosetta Stone
Type Theory vs Set Theory
Typed Combinatory Logic
Types are Higher Groupoids
Types of Modules
Uncapacitated Facility location
Uncountable Cardinalities
Undecidability of the Halting Problem
Undecidability of the Membership Problem
Uniform Definition of Haskell Functions
Uniform Topology
union of disjoint intervals giving an interval length
Unique construction of Adjunction
Uniqueness of fourier series
Uniqueness of functions created using induction principle
Uniqueness Principle for Sigma Types
Unit and Counit as Singleton and Evaluation
Unit and Counit as Universal Arrows
Units (Rings)
Univalence
Univalence Implies Function Extensionality
Univalence Implies Weak Function Extensionality
Universal Elements are Universal Elements
Universal Finite Automaton
Universal Property (Mac Lane)
Universal Property (Riehl)
Universal Property of Polynomial Rings
Universal Property of Products and Coproducts
Universal Turing Machine
Universality is Decidable for One-Clock Timed Automata
Universality of Concurrent Object Class
Universe with circle is not a groupoid
Universes
Unraked Tree Automata
Unranked Trees in Logic
Untiming Timed Automata
Untitled
Updatable Timed Automata
Updatable Timed Automata with only update being x=x-1
Updatable Timed Automata with only x=c and x=y updates
Updatable Timed Automata without Diagonal Constraints and c in N
Urysohn Lemma
Urysohn Metrization Theorem
Valuation of a P-name
Variable Rule for Match Function
Vertex Cover Problem
Vertical and Horizontal Composition of Natural Transformations
Von Neumann Ordinals
W-Types
W-Types are the initial element in the category of W-Algebras
Weak Function Extensionality
Weakly initial objects and joint weakly initial sets
Web of Reductions
Weighted Automata
Weighted Automata as Formal Power Series
Weighted Automata on Series
Well Structured Transition Systems
Well-Preorder
What are Differential equations
What is Topology
WHILE programs
Why Differential Equations
Winning Arena for Büchi Games
Winning Arena for Parity Games
Winning Arena for Rabin Games
Winning Arena for Rabin Games - Fail
Winning Arena for Reachability Games
Winning Condition for Games on Graphs
Winning Strategy for Büchi Games
Winning Strategy for Player 1 in Banach-Mazur games
Winning Strategy for Player 2 in Banach-Mazur games
Winning Strategy for Reachability Games
Word Problem for Finitely Presented Groups is Undecidable
Word Problem for Finitely Presented Groups is Undecidable Lemma 1
ww where w is any word
Yoneda Embedding
Yoneda Lemma
Zero Divisors
Zig-Zag Product Construction of Expander Graphs
Zone Automata
Zone Automata Example
Presentations
Model Repair of Time Petri Nets
Model repair planning
Revisiting Complexity of First-Order and Monadic Second Order Logic
Verification of MST
Weak Alternating Automata are not that Weak
Weak Alternating Automata are not that Weak Presentation
Talks
Advances in Algorithmic Meta Theorems
Automated Verification of Test Input Generators
Codes - Madhur Tulsiani
concurrent stochastic games
Conterfactual Explanations for MITL Violation
Discrete Time Markov Chain
Greybox Learning of Languages Recognizable by Event Recording Automata
Guruswami
HyperPropertiers
Muller LTL Formulas
Percolation Thoery
Synchronized Distributed Games
Three views on LIA
Home
❯
tags
❯
Tag: Note
Tag: Note
1098 items with this tag.
Jul 22, 2025
letrec-expressions to Irrefurtable let-expressions
Note
Incomplete
Jul 22, 2025
locally presentable categories
Note
Jul 22, 2025
omega-Automata
Note
Jul 22, 2025
sigma-paradise
Note
Jul 22, 2025
Automated Verification of Test Input Generators
Note
Incomplete
Jul 22, 2025
What are Differential equations
Note
Jul 22, 2025
What is Topology
Note
Jul 22, 2025
Why Differential Equations
Note
Jul 22, 2025
Winning Arena for Büchi Games
Note
Jul 22, 2025
Winning Arena for Parity Games
Note
Jul 22, 2025
Winning Arena for Rabin Games - Fail
Note
Jul 22, 2025
Winning Arena for Rabin Games
Note
Incomplete
Jul 22, 2025
Winning Arena for Reachability Games
Note
Jul 22, 2025
Winning Condition for Games on Graphs
Note
Jul 22, 2025
Winning Strategy for Büchi Games
Note
Jul 22, 2025
Winning Strategy for Player 1 in Banach-Mazur games
Note
Incomplete
Jul 22, 2025
Winning Strategy for Player 2 in Banach-Mazur games
Note
Incomplete
Jul 22, 2025
Winning Strategy for Reachability Games
Note
Jul 22, 2025
Yoneda Embedding
Note
Incomplete
Jul 22, 2025
Yoneda Lemma
Note
Jul 22, 2025
Zero Divisors
Note
Incomplete
Jul 22, 2025
Zig-Zag Product Construction of Expander Graphs
Note
Incomplete
Jul 22, 2025
Zone Automata
Note
Jul 22, 2025
hat V- Deterministic Büchi Automata
Note
Jul 22, 2025
l,k Ajtai-Fagin Game for EMSO
Note
Incomplete
Jul 22, 2025
let-expressions in Enriched Lambda Calculus
Note
Jul 22, 2025
letrec-expressions in Enriched lambda Calculus
Note
Jul 22, 2025
Unraked Tree Automata
Note
Incomplete
Jul 22, 2025
Unranked Trees in Logic
Note
Jul 22, 2025
Untiming Timed Automata
Note
Jul 22, 2025
Updatable Timed Automata
Note
Jul 22, 2025
Urysohn Lemma
Note
Jul 22, 2025
Urysohn Metrization Theorem
Note
Jul 22, 2025
Valuation of a P-name
Note
Incomplete
Jul 22, 2025
Variable Rule for Match Function
Note
Jul 22, 2025
Vertex Cover Problem
Note
Jul 22, 2025
Vertical and Horizontal Composition of Natural Transformations
Note
Jul 22, 2025
Von Neumann Ordinals
Note
Jul 22, 2025
W-Types are the initial element in the category of W-Algebras
Note
Jul 22, 2025
W-Types
Note
Jul 22, 2025
WHILE programs
Note
Incomplete
Jul 22, 2025
Weak Function Extensionality
Note
Jul 22, 2025
Weakly initial objects and joint weakly initial sets
Note
Jul 22, 2025
Web of Reductions
Note
Incomplete
Jul 22, 2025
Weighted Automata as Formal Power Series
Note
Jul 22, 2025
Weighted Automata on Series
Note
Incomplete
Jul 22, 2025
Weighted Automata
Note
Incomplete
Jul 22, 2025
Well Structured Transition Systems
Note
Incomplete
Jul 22, 2025
Well-Preorder
Note
Jul 22, 2025
Uncountable Cardinalities
Note
Jul 22, 2025
Undecidability of the Halting Problem
Note
Jul 22, 2025
Undecidability of the Membership Problem
Note
Jul 22, 2025
Uniform Definition of Haskell Functions
Note
Jul 22, 2025
Unique construction of Adjunction
Note
Jul 22, 2025
Uniqueness Principle for Sigma Types
Note
Jul 22, 2025
Uniqueness of fourier series
Note
Jul 22, 2025
Uniqueness of functions created using induction principle
Note
Jul 22, 2025
Unit and Counit as Universal Arrows
Note
Jul 22, 2025
Units (Rings)
Note
Jul 22, 2025
Univalence Implies Function Extensionality
Note
Jul 22, 2025
Univalence Implies Weak Function Extensionality
Note
Jul 22, 2025
Univalence
Note
Jul 22, 2025
Universal Elements are Universal Elements
Note
Jul 22, 2025
Universal Finite Automaton
Note
Incomplete
Jul 22, 2025
Universal Property (Mac Lane)
Note
Jul 22, 2025
Universal Property (Riehl)
Note
Jul 22, 2025
Universal Property of Polynomial Rings
Note
Incomplete
Jul 22, 2025
Universal Property of Products and Coproducts
Note
Jul 22, 2025
Universal Turing Machine
Note
Jul 22, 2025
Universality is Decidable for One-Clock Timed Automata
Note
Incomplete
Jul 22, 2025
Universality of Concurrent Object Class
Note
Incomplete
Jul 22, 2025
Universe with circle is not a groupoid
Note
Incomplete
Jul 22, 2025
Universes
Note
Jul 22, 2025
Tree Decomposition
Note
Jul 22, 2025
Tree Packing
Note
Incomplete
Jul 22, 2025
Tree Path Maxima Problem
Note
Incomplete
Jul 22, 2025
Tree Width
Note
Incomplete
Jul 22, 2025
Trees (Automata Theory)
Note
Diagram
Jul 22, 2025
Triangular Graphs
Note
Jul 22, 2025
Trigonometric Functions
Note
Jul 22, 2025
Tube Lemma
Note
Jul 22, 2025
Turing Machine Configuration
Note
Jul 22, 2025
Turing Machines with multiple tapes
Note
Jul 22, 2025
Turing Machines
Note
Jul 22, 2025
Two Stacks
Note
Jul 22, 2025
Two Variable Adjunction
Note
Jul 22, 2025
Two-Way Infinite Tape Turing Machine
Note
Jul 22, 2025
Tychonoff's Theorem
Note
Jul 22, 2025
Type Inhabitation in P-SPACE
Note
Incomplete
Jul 22, 2025
Type Theory vs Set Theory
Note
Jul 22, 2025
Type of a Set and a Relation
Note
Jul 22, 2025
Typed Combinatory Logic
Note
Jul 22, 2025
Types are Higher Groupoids
Note
Jul 22, 2025
Types of Modules
Note
Incomplete
Jul 22, 2025
Uncapacitated Facility location
Note
Jul 22, 2025
Topological Space of Paths in a Timed Automata is Baire
Note
Incomplete
Jul 22, 2025
Topological Spaces as Frames
Note
Incomplete
Jul 22, 2025
Topological Spaces
Note
Jul 22, 2025
Topology over Finite Paths in a Timed Automata
Note
Incomplete
Jul 22, 2025
Torsion submodule
Note
Jul 22, 2025
Total Spaces (HoTT)
Note
Jul 22, 2025
Total Unimodularity
Note
Incomplete
Jul 22, 2025
Trace and Norm
Note
Jul 22, 2025
Traces of Powers of Adjacency Matrices
Note
Jul 22, 2025
Trakhtenbrot's Theorem
Note
Incomplete
Jul 22, 2025
Transitive Sets
Note
Jul 22, 2025
Translating Haskell Programs to Lambda Calculus
Note
Incomplete
Jul 22, 2025
Translation Scheme from Haskell to Lambda Calculus for Definitions
Note
Incomplete
Jul 22, 2025
Translation Scheme from Haskell to Lambda Calculus for Expressions
Note
Incomplete
Jul 22, 2025
Translation Scheme from Haskell to Lambda Calculus for Some RHS only options
Note
Incomplete
Jul 22, 2025
Transport over a function between families
Note
Jul 22, 2025
Transport
Note
Jul 22, 2025
Transports in a Family of Paths
Note
Jul 22, 2025
Transpose of a Weighted Automata
Note
Jul 22, 2025
Travelling Salesman Problem
Note
Jul 22, 2025
Tensor Products as Universal Properties
Note
Incomplete
Jul 22, 2025
Tensors
Note
Jul 22, 2025
Textbook review 8 math
Note
Incomplete
Jul 22, 2025
The Category Ring
Note
Incomplete
Jul 22, 2025
The Principle of Unique Choice
Note
Jul 22, 2025
The Riemann Sphere
Note
Jul 22, 2025
The fundamental theorem of Galois Theory
Note
Jul 22, 2025
Theorems about Stopping Times
Note
Jul 22, 2025
There is a non-trivial proof for reflexivity of equality in Circle
Note
Jul 22, 2025
Threshold Equivalence
Note
Incomplete
Jul 22, 2025
Threshold Languages
Note
Jul 22, 2025
Tietze Extension Theorem
Note
Jul 22, 2025
Time Petri Net
Note
Jul 22, 2025
Time and Space Hierarchy Theorems
Note
Incomplete
Jul 22, 2025
Timed Automata Alternate Definition
Note
Incomplete
Jul 22, 2025
Timed Automata with Diagonal Constraints
Note
Jul 22, 2025
Topological Groups
Note
Jul 22, 2025
Topological Invariants
Note
Jul 22, 2025
Topological Semantics for LTL
Note
Jul 22, 2025
Strong Normalization Theorem
Note
Jul 22, 2025
Strongly Regular Graphs
Note
Jul 22, 2025
Structure Preserving Maps
Note
Jul 22, 2025
Sub-Games
Note
Jul 22, 2025
Sub-Types
Note
Jul 22, 2025
Sub-basis
Note
Jul 22, 2025
Submodule and quotients
Note
Jul 22, 2025
Subobjects
Note
Jul 22, 2025
Subset Relation between Timed Regular Languages
Note
Jul 22, 2025
Subset Sum Problem
Note
Incomplete
Jul 22, 2025
Subspace Topology
Note
Jul 22, 2025
Successor invariant FOL on finite structures
Note
Incomplete
Jul 22, 2025
Succinct Encoding of Natural Numbers Using Strings
Note
Jul 22, 2025
Sum Constructor Pattern Matching to Lambda Calculus
Note
Incomplete
Jul 22, 2025
Sum Types
Note
Jul 22, 2025
Sum of all Fibers of a Function is the Domain
Note
Jul 22, 2025
Sum off all Functions from all types are equivalent to a type family
Note
Jul 22, 2025
Support of an Automorphism on a Graph
Note
Jul 22, 2025
Surjection and Embedding are equivalent to Equivalences
Note
Jul 22, 2025
Surjections and Embeddings
Note
Jul 22, 2025
Suspensions (HoTT)
Note
Jul 22, 2025
Syntax of First Order Logic
Note
Jul 22, 2025
System of First Order Differential Equations
Note
Jul 22, 2025
TAS Lock
Note
Jul 22, 2025
TTAS Lock
Note
Jul 22, 2025
Splitting of Primes in extensions
Note
Jul 22, 2025
Stable Subsemodule of Series
Note
Incomplete
Jul 22, 2025
Stage Comparisons
Note
Incomplete
Jul 22, 2025
Stages(Finite Model Theory)
Note
Incomplete
Jul 22, 2025
Star Free Regular Languages are Aperiodic
Note
Incomplete
Jul 22, 2025
Star Free Regular Languages can be accepted by FO on words
Note
Incomplete
Jul 22, 2025
Starvation-freeness
Note
Jul 22, 2025
Steiner Trees are NP Complete
Note
Jul 22, 2025
Steiner Trees
Note
Jul 22, 2025
Stochastic Languages are Regular if Threshold Point is Isolated
Note
Incomplete
Jul 22, 2025
Stochastic Languages are Undecidable in General
Note
Incomplete
Jul 22, 2025
Stochastic Languages
Note
Incomplete
Jul 22, 2025
Stoke's Theorem
Note
Jul 22, 2025
Stopping Time
Note
Incomplete
Jul 22, 2025
Strategy for Games on Graphs
Note
Jul 22, 2025
Strictly Creating Limits
Note
Jul 22, 2025
Strings in Logic
Note
Jul 22, 2025
Solution of a differential equation
Note
Jul 22, 2025
Solution of an LP
Note
Incomplete
Jul 22, 2025
Solving SAT using MSO
Note
Jul 22, 2025
Solving a First Order ODE
Note
Jul 22, 2025
Solving a linear differential equations
Note
Jul 22, 2025
Some Algorithms for finding the Minimum Spanning Trees
Note
Incomplete
Jul 22, 2025
Some Contractible Types
Note
Jul 22, 2025
Some Generalization of Inductive Datatypes
Note
Jul 22, 2025
Some Type Formers respect Mere Propositions
Note
Jul 22, 2025
Some Useful Inequalities
Note
Jul 22, 2025
Some ways to Characterize Homotopy W types
Note
Jul 22, 2025
Sparse recovery-compressed sensing
Note
Incomplete
Jul 22, 2025
Special Adjunct Functor Theorem
Note
Jul 22, 2025
Special Case of Tree Path Maxima Problem
Note
Incomplete
Jul 22, 2025
Special Types of Measures
Note
Jul 22, 2025
Specifying a Type
Note
Jul 22, 2025
Spectrum of The adjacency Matrix
Note
Jul 22, 2025
Spectrum of a Ring
Note
Incomplete
Jul 22, 2025
Spectrums in PIDs
Note
Incomplete
Jul 22, 2025
Sphere (HoTT)
Note
Jul 22, 2025
Spin Locks
Note
Incomplete
Jul 22, 2025
Split Exact Sequences
Note
Jul 22, 2025
Splitting Fields
Note
Jul 22, 2025
Shortest Path using Primal-Dual
Note
Jul 22, 2025
Showing a Point is Isolated is Undecidable
Note
Incomplete
Jul 22, 2025
Sigma Field
Note
Incomplete
Jul 22, 2025
Sigma Types respect Universal Properties
Note
Jul 22, 2025
Similar description of inductive types lead to equal types
Note
Jul 22, 2025
Simple Regular Expressions
Note
Incomplete
Jul 22, 2025
Simple let expressions to Ordinary Lambda Calculus
Note
Incomplete
Jul 22, 2025
Simplex Method
Note
Incomplete
Jul 22, 2025
Simplicial Complexes
Note
Incomplete
Jul 22, 2025
Simply Connected
Note
Jul 22, 2025
Simply Typed Lambda Calculus Syntax
Note
Jul 22, 2025
Simulation for Zone Automata
Note
Jul 22, 2025
Simultaneous Fixed Points
Note
Incomplete
Jul 22, 2025
Size of subsets of Reals
Note
Incomplete
Jul 22, 2025
Slice Category Strictly Creates Limits
Note
Jul 22, 2025
Small Progress Measures
Note
Incomplete
Jul 22, 2025
Small Limits in Set are Equalizers
Note
Jul 22, 2025
Small Tree Decomposition
Note
Incomplete
Jul 22, 2025
Snake Lemma
Note
Jul 22, 2025
Second Order Logic
Note
Incomplete
Jul 22, 2025
Semantics for CTL
Note
Jul 22, 2025
Semantics for LTL
Note
Jul 22, 2025
Semantics of First Order Logic
Note
Jul 22, 2025
Semaphores
Note
Incomplete
Jul 22, 2025
Semi Ring
Note
Jul 22, 2025
Semi-Groups
Note
Incomplete
Jul 22, 2025
Semi-Modules
Note
Incomplete
Jul 22, 2025
Semifield
Note
Incomplete
Jul 22, 2025
Separable Extensions
Note
Jul 22, 2025
Separable Polynomials
Note
Jul 22, 2025
Separable Spaces
Note
Jul 22, 2025
Separating and Coseparating sets
Note
Jul 22, 2025
Separation Axioms
Note
Jul 22, 2025
Separation Oracle for perfect matching LP
Note
Incomplete
Jul 22, 2025
Sequent Calculus
Note
Jul 22, 2025
Sequential Transducers
Note
Incomplete
Jul 22, 2025
Sequentially Compact
Note
Jul 22, 2025
Set Cover Problem
Note
Jul 22, 2025
Set is Complete
Note
Jul 22, 2025
Sets in Type Theory
Note
Jul 22, 2025
Short Exact Sequences
Note
Jul 22, 2025
Representable Matroids
Note
Incomplete
Jul 22, 2025
Representable Universal Property of Colimits
Note
Jul 22, 2025
Representable Universal Property of Limits
Note
Jul 22, 2025
Representation of Limits and Colimits as Limits in category of sets
Note
Jul 22, 2025
Residuals using Longest Common Prefixes
Note
Incomplete
Jul 22, 2025
Result of Expressive Power of Gödel's system T
Note
Jul 22, 2025
Retract of an Equivalence is an Equivalence
Note
Jul 22, 2025
Retractions
Note
Jul 22, 2025
Retracts (HoTT)
Note
Jul 22, 2025
Right Congruent Equivalence Relation
Note
Incomplete
Jul 22, 2025
Ring Homomorphisms
Note
Incomplete
Jul 22, 2025
Ring
Note
Jul 22, 2025
Rules for Higher Inductive Types
Note
Jul 22, 2025
Runtime
Note
Jul 22, 2025
S^1
Note
Jul 22, 2025
Satisfiability in First Order Logic
Note
Incomplete
Jul 22, 2025
Savitch's Theorem
Note
Incomplete
Jul 22, 2025
Search vs Decision for NP complete problems
Note
Incomplete
Jul 22, 2025
Second Countability
Note
Jul 22, 2025
Ranked Tree Automata
Note
Diagram
Jul 22, 2025
Ranked Trees in Logic
Note
Jul 22, 2025
Rational Functions (Weighted Automata)
Note
Incomplete
Jul 22, 2025
Rational Relations as Weighted Automata
Note
Jul 22, 2025
Rational Series
Note
Incomplete
Jul 22, 2025
Rational, Automatic and Recognizable relations
Note
Jul 22, 2025
Reachability Algorithm for Zone Automata
Note
Jul 22, 2025
Reachability in Finite Pushdown VASS
Note
Incomplete
Jul 22, 2025
Reachability in Lossy Channel Systems
Note
Jul 22, 2025
Reachable Vectors
Note
Jul 22, 2025
Recursive and Recursively Eumberable Sets
Note
Jul 22, 2025
Reducibility Theorems
Note
Jul 22, 2025
Reducibility
Note
Jul 22, 2025
Reducing a Weighted Automata
Note
Incomplete
Jul 22, 2025
Reduction
Note
Jul 22, 2025
Reflection Theorems
Note
Incomplete
Jul 22, 2025
Reflective Subcategory
Note
Jul 22, 2025
Reflective subcategories create limits and contain colimits
Note
Jul 22, 2025
Region Automata Alternate Definition
Note
Incomplete
Jul 22, 2025
Regular Permutation Groups
Note
Jul 22, 2025
Regular Spaces
Note
Jul 22, 2025
Regular Tree Languages
Note
Jul 22, 2025
Relative Strength of ZF- and ZF
Note
Incomplete
Jul 22, 2025
Removable Singularities in Analytic Functions
Note
Jul 22, 2025
Repeated Events
Note
Incomplete
Jul 22, 2025
Representable Functors Define Representing Objects
Note
Jul 22, 2025
Representable Functors
Note
Jul 22, 2025
Quanitifier Elimination for Natural Numbers With Successor
Note
Jul 22, 2025
Quantified Boolean Formulas
Note
Incomplete
Jul 22, 2025
Quantifier Rank
Note
Incomplete
Jul 22, 2025
Quantifier rank
Note
Incomplete
Jul 22, 2025
Quasi-inverse is not a Mere Proposition
Note
Jul 22, 2025
Queue Based Locks
Note
Jul 22, 2025
Quotient Rings
Note
Incomplete
Jul 22, 2025
Quotient Topology
Note
Jul 22, 2025
Quotienting by monic polynomial is an abelian group isomorphism with direct sum
Note
Incomplete
Jul 22, 2025
Quotients in Monoids
Note
Incomplete
Jul 22, 2025
Quotients of Polynomial Rings
Note
Incomplete
Jul 22, 2025
Quotients of Syntactic Monoid of a language
Note
Incomplete
Jul 22, 2025
R with Lower Limit topology
Note
Jul 22, 2025
R-Mod is a CCC
Note
Incomplete
Jul 22, 2025
RAPL
Note
Jul 22, 2025
R^w
Note
Jul 22, 2025
R_K
Note
Jul 22, 2025
Radon-Nikodym Theorem for Countably Generated Sigma Field
Note
Incomplete
Jul 22, 2025
Ramsay's Theorem
Note
Incomplete
Jul 22, 2025
Random Access Machines
Note
Incomplete
Jul 22, 2025
Randomised or Probabilistic Computation
Note
Incomplete
Jul 22, 2025
Randomized Algorithms
Note
Incomplete
Jul 22, 2025
Rank of a module
Note
Jul 22, 2025
Rank-k Types (FO)
Note
Jul 22, 2025
Rank-k m,l Types MSO
Note
Incomplete
Jul 22, 2025
Product topology
Note
Jul 22, 2025
Products and Coporducts
Note
Jul 22, 2025
Products in Rings
Note
Incomplete
Jul 22, 2025
Products in Topology from Products in Category Theory
Note
Example
Jul 22, 2025
Products respect Universal Properties
Note
Jul 22, 2025
Program for RAM
Note
Incomplete
Jul 22, 2025
Proof by Induction in Coq
Note
Incomplete
Jul 22, 2025
Proof for Reflection Theorem
Note
Jul 22, 2025
Properties of Minimum Spanning Trees
Note
Incomplete
Jul 22, 2025
Propositional Resizing
Note
Jul 22, 2025
Propositional Truncation
Note
Jul 22, 2025
Pullbacks and Pushouts
Note
Jul 22, 2025
Pure Sequential Transducers
Note
Incomplete
Jul 22, 2025
Push Down Automata
Note
Jul 22, 2025
Quadratic Reciprocity
Note
Jul 22, 2025
Primal - Dual LP
Note
Jul 22, 2025
Primal-Dual Algorithm for Bipartite Min-cost Perfect Matching
Note
Incomplete
Jul 22, 2025
Primal-Dual Algorithm for general Min-cost Perfect Matching
Note
Incomplete
Jul 22, 2025
Prime Ideals and Maximal Ideals
Note
Jul 22, 2025
Prime Ideals are Maximal in PIDs
Note
Incomplete
Jul 22, 2025
Prime and Irreducible elements
Note
Jul 22, 2025
Prime elements are irreducible
Note
Incomplete
Jul 22, 2025
Primitive Element Theorem
Note
Jul 22, 2025
Primitive Recursion
Note
Jul 22, 2025
Primitive Transitive Permutation Group
Note
Jul 22, 2025
Principle Ideals
Note
Incomplete
Jul 22, 2025
Probabilistic Automata
Note
Incomplete
Jul 22, 2025
Probabilistic Semantics for LTL
Note
Jul 22, 2025
Probabilistically Checkable Proof
Note
Incomplete
Jul 22, 2025
Probability Measure over Finite Paths in a Timed Automata
Note
Incomplete
Jul 22, 2025
Probability Theory and Gambling
Note
Jul 22, 2025
Probability
Note
Jul 22, 2025
Product Constructor Pattern Matching to Lambda Calculus
Note
Incomplete
Jul 22, 2025
Product Measures
Note
Jul 22, 2025
Product Type(HoTT)
Note
Jul 22, 2025
Product Type
Note
Jul 22, 2025
Product in Category Theory
Note
Jul 22, 2025
Product of Well-Preorders
Note
Jul 22, 2025
Pattern Matching to Ordinary Lambda Calculus
Note
Incomplete
Jul 22, 2025
Patterns
Note
Jul 22, 2025
Peano Axioms and Type Theory
Note
Jul 22, 2025
Pebble Games
Note
Incomplete
Jul 22, 2025
Perfect Fields
Note
Jul 22, 2025
Phase Flow
Note
Jul 22, 2025
Phase Space
Note
Jul 22, 2025
Pointed Predicates and maps
Note
Jul 22, 2025
Pointed Type
Note
Jul 22, 2025
Polynomial Rings over a Noetherian Ring are Noetherian
Note
Incomplete
Jul 22, 2025
Polynomial Rings
Note
Incomplete
Jul 22, 2025
Polynomial and matrices over semi rings form semi rings
Note
Jul 22, 2025
Polynomial-Time Hierarchy
Note
Incomplete
Jul 22, 2025
Polytime Approx Algo for Steiner Trees
Note
Incomplete
Jul 22, 2025
Positive Formulas
Note
Incomplete
Jul 22, 2025
Post Correspondence Problem
Note
Incomplete
Jul 22, 2025
Power Series
Note
Jul 22, 2025
Pre-Image of a Regular Language under a Sequential Transducer is Regular
Note
Jul 22, 2025
Predicable Process
Note
Incomplete
Jul 22, 2025
Prefix Preserving
Note
Incomplete
Jul 22, 2025
Preorder
Note
Jul 22, 2025
Presentation of a Group
Note
Jul 22, 2025
Preservation, Reflection and Creation of Limits
Note
Jul 22, 2025
Prim's Algorithm
Note
Incomplete
Jul 22, 2025
Path Connectedness
Note
Jul 22, 2025
Path Induction
Note
Jul 22, 2025
Paths on Graphs and Finite Variable Logics
Note
Jul 22, 2025
P-Generic classes
Note
Incomplete
Jul 22, 2025
P-name
Note
Incomplete
Jul 22, 2025
PCP'
Note
Incomplete
Jul 22, 2025
PSPACE-Hardness of LTL Model Checking
Note
Incomplete
Jul 22, 2025
PSPACE
Note
Incomplete
Jul 22, 2025
PTAS (Complexity Class)
Note
Incomplete
Jul 22, 2025
Pairs in Lambda Calculus
Note
Jul 22, 2025
Partial Functions
Note
Jul 22, 2025
Partial Isomorphism
Note
Jul 22, 2025
Object Classifiers
Note
Jul 22, 2025
Olog
Note
Jul 22, 2025
Omega-Regular Languages
Note
Jul 22, 2025
One Parameter Group Of Diffeomorphisms
Note
Jul 22, 2025
One Point Compactification
Note
Jul 22, 2025
Open and Closed Functions
Note
Jul 22, 2025
Operations on Integrals
Note
Jul 22, 2025
Opposite Category
Note
Jul 22, 2025
Optimal Reachability in Weighted Timed Games
Note
Jul 22, 2025
Optimisations for Expressions containing FAIL and Fatbar
Note
Incomplete
Jul 22, 2025
Optimisations for Overlapping Patterns
Note
Jul 22, 2025
Order Invariant FO(Cnt) is not Gaifman Local
Note
Incomplete
Jul 22, 2025
Order Invariant FO
Note
Incomplete
Jul 22, 2025
Order Topology
Note
Jul 22, 2025
Ordered Fields
Note
Incomplete
Jul 22, 2025
Ordering between Axiomatic Theories
Note
Incomplete
Jul 22, 2025
Ordinal Definable Sets
Note
Incomplete
Jul 22, 2025
Ordinary Generating Functions
Note
Jul 22, 2025
Owing to a Person vs Them having a Right against you
Note
Jul 22, 2025
P (Complexity Class)
Note
Jul 22, 2025
Natural Numbers with Successor and Ordering
Note
Jul 22, 2025
Natural Numbers with Successor
Note
Jul 22, 2025
Natural Transformation
Note
Jul 22, 2025
Neighborhood (Finite Model Theory)
Note
Incomplete
Jul 22, 2025
Network Flows
Note
Incomplete
Jul 22, 2025
Network Reliability
Note
Incomplete
P
perfect
SAT
Jul 22, 2025
Networks of Timed Automata
Note
Jul 22, 2025
Newman's Lemma
Note
Jul 22, 2025
Nivat's Theorem
Note
Incomplete
Jul 22, 2025
Noetherian Modules
Note
Incomplete
Jul 22, 2025
Noetherian Ring and PIDs
Note
Incomplete
Jul 22, 2025
Non deterministic Space Hierarchy Theorem
Note
Incomplete
Jul 22, 2025
Non deterministic Time Hierarchy Theorem
Note
Incomplete
Jul 22, 2025
Normal Extensions
Note
Jul 22, 2025
Normal Spaces
Note
Jul 22, 2025
Normalization Theorem for Gödel's system T
Note
Jul 22, 2025
Normalizing a Transducer
Note
Jul 22, 2025
Not Unification Algorithm For Type Inference
Note
Jul 22, 2025
Number Field
Note
Jul 22, 2025
Number Rings
Note
Jul 22, 2025
ODE
Note
Jul 22, 2025
Monomorphisms and Epimorphisms in Rings
Note
Incomplete
Jul 22, 2025
Monomorphisms and Epimorphisms
Note
Jul 22, 2025
Monotone Domination Order
Note
Incomplete
Jul 22, 2025
Monotone, Inflationary and Inductive Functions
Note
Incomplete
Jul 22, 2025
Monotonicity is Undecidable
Note
Jul 22, 2025
Motivation for Concurrency Theory
Note
Jul 22, 2025
Motivation for Games
Note
Incomplete
Jul 22, 2025
Mu-Recursion
Note
Jul 22, 2025
Multi-choose
Note
Jul 22, 2025
Multi-way Cuts
Note
Incomplete
Jul 22, 2025
Multiplicative Characters
Note
Jul 22, 2025
Multiplicity Automata
Note
Incomplete
Jul 22, 2025
Multiplicity Codes
Note
Incomplete
Jul 22, 2025
Multiset
Note
Jul 22, 2025
Multivariate Polynomial Interpolation on Lines
Note
Incomplete
Jul 22, 2025
Mutual Exclusion
Note
Jul 22, 2025
Mutual Left and Right Adjunctions
Note
Jul 22, 2025
Myhill Nerode Theorem
Note
Jul 22, 2025
N is the initial object in the category of N-Algebras
Note
Jul 22, 2025
NP (Complexity Class)
Note
Jul 22, 2025
NP Complete
Note
Jul 22, 2025
N_L admits Quantifier Elimination
Note
Incomplete
Jul 22, 2025
Naive Algorithm for Reachability in Zone Automata
Note
Jul 22, 2025
Natural Deduction
Note
Jul 22, 2025
Natural Numbers in Type Theory
Note
Jul 22, 2025
Metrizable Spaces
Note
Jul 22, 2025
Miller-Rabin Algorithm for Primality
Note
Incomplete
Jul 22, 2025
Minimizing a Weighted Automata
Note
Incomplete
Jul 22, 2025
Minimum Spanning Trees
Note
Incomplete
Jul 22, 2025
Minimum k-cut Problem
Note
Incomplete
Jul 22, 2025
Mixed Nash Equilibrium
Note
Incomplete
Jul 22, 2025
Mixed Strategies
Note
Jul 22, 2025
Mixture Rule for Match Expression
Note
Jul 22, 2025
Model Checking of CTL formulas
Note
Jul 22, 2025
Model Repair and Conformance Checking of Time Aware Models
Note
Incomplete
Jul 22, 2025
Modular Machines are Turing Complete
Note
Incomplete
Jul 22, 2025
Modular Machines
Note
Incomplete
Jul 22, 2025
Modules
Note
Jul 22, 2025
Monadic Second Order Logic
Note
Jul 22, 2025
Monoid Homomorphisms
Note
Jul 22, 2025
Monoid Ring
Note
Incomplete
Jul 22, 2025
Monoidal Category
Note
Incomplete
Jul 22, 2025
Monoidal Closed Category
Note
Incomplete
Jul 22, 2025
Monoids as Idempotent Commutative Langauges
Note
Incomplete
Jul 22, 2025
Monoids as Languages
Note
Jul 22, 2025
Monoids as Regular Languages
Note
Jul 22, 2025
Monoids
Note
Jul 22, 2025
Monolithic Timed Automaton for a Network of Timed Automata
Note
Jul 22, 2025
Monomials, Polynomials and Series
Note
Incomplete
Jul 22, 2025
Lower Bound on Shared Process
Note
Jul 22, 2025
Löwenheim-Skolem and its Variants
Note
Jul 22, 2025
M is noetherian if for every sub-module N, N and MN are noetherian
Note
Jul 22, 2025
MSO has Problems in each PH level
Note
Jul 22, 2025
MSO on Finite Words accept Regular Languages
Note
Incomplete
Jul 22, 2025
MTP 17-09-24
Note
Incomplete
Jul 22, 2025
Machinery for Probabilistic Semantics for Timed Automata
Note
Incomplete
Jul 22, 2025
Machines Realising Rational Functions
Note
Jul 22, 2025
Martingale Transform
Note
Incomplete
Jul 22, 2025
Martingales
Note
Incomplete
Jul 22, 2025
Match Function for Enriched Lambda Calculus
Note
Jul 22, 2025
Matching Problem
Note
Incomplete
Jul 22, 2025
Matroid Intersection
Note
Incomplete
Jul 22, 2025
Matroids
Note
Jul 22, 2025
Max wt base of a matroid
Note
Incomplete
Jul 22, 2025
Mealy Machines and Moore Machines
Note
Incomplete
Jul 22, 2025
Measurable Functions
Note
Jul 22, 2025
Measure Space
Note
Incomplete
Jul 22, 2025
Measurement of Redundancy in a code
Note
Jul 22, 2025
Mere Propositions are Sets
Note
Jul 22, 2025
Mere Propositions
Note
Jul 22, 2025
Metric Topology
Note
Jul 22, 2025
Linear Algorithm for Special case of TPMP
Note
Incomplete
Jul 22, 2025
Linear Programming
Note
Jul 22, 2025
Linear Temporal Logic
Note
Jul 22, 2025
Linear systems with constant coefficients
Note
Jul 22, 2025
List decoding Folded RS
Note
Incomplete
Jul 22, 2025
List decoding RS codes up to the Johnson radius
Note
Incomplete
Jul 22, 2025
Local Compactness
Note
Jul 22, 2025
Local Connectedness
Note
Jul 22, 2025
Local Correcting and Decoding of RM codes
Note
Incomplete
Jul 22, 2025
Local Decoding
Note
Jul 22, 2025
Local Equivalence Lemma
Note
Jul 22, 2025
Local Equivalence
Note
Jul 22, 2025
Local Path Connectedness
Note
Jul 22, 2025
Local Self-correction of Bivariate Multiplicity Codes
Note
Incomplete
Jul 22, 2025
Local problems on codes
Note
Incomplete
Jul 22, 2025
Locality (Finite Model Theory)
Note
Jul 22, 2025
Locally Finite and Summable Series
Note
Incomplete
Jul 22, 2025
Locally Small and Complete Categories with a small coseparating set where all collections of subobjects of a fixed object have an intersection then it is cocomplete
Note
Jul 22, 2025
Locally Small, Complete category with a small coseparator where all collections of subobjects of an object have an intersection has all continuous functors form it be representable
Note
Jul 22, 2025
Location Lemma
Note
Incomplete
Jul 22, 2025
Logic L capturing the complexity class K
Note
Jul 22, 2025
Logic, Regular Languages and Languages Recognized by Monoids
Note
Incomplete
Jul 22, 2025
Loop Space
Note
Jul 22, 2025
Loop is not refl
Note
Jul 22, 2025
Lovasz Local Lemma
Note
Incomplete
Jul 22, 2025
Lemma 1 for Quasi-inverse is not a Mere Proposition
Note
Jul 22, 2025
Lemma 2 for Quasi-inverse is not a Mere Proposition
Note
Jul 22, 2025
Lemma for BEF Games
Note
Incomplete
Jul 22, 2025
Lemma for H-smooth Words
Note
Incomplete
Jul 22, 2025
Lemma for J-smooth words
Note
Incomplete
Jul 22, 2025
Lemma for R-smooth Words
Note
Incomplete
Jul 22, 2025
Lemma for Threshold Equivalence
Note
Jul 22, 2025
Lifted Reed Solomon Codes
Note
Incomplete
Jul 22, 2025
Lifting Correspondence
Note
Jul 22, 2025
Lifts
Note
Jul 22, 2025
Limits and Colimits as Adjunctions
Note
Jul 22, 2025
Limits and Colimits in multiple variables can be taken in any order
Note
Jul 22, 2025
Limits and Colimits
Note
Jul 22, 2025
Lindelof Space
Note
Jul 22, 2025
Lindenbaum-Tarski Algebra
Note
Incomplete
Jul 22, 2025
Line Graph
Note
Jul 22, 2025
Line Integral
Note
Jul 22, 2025
LP algorithm for Bipartite Matching
Note
Incomplete
Jul 22, 2025
LP algorithm for general Perfect Matching
Note
Incomplete
Jul 22, 2025
LTL vs CTL
Note
Incomplete
Jul 22, 2025
L_infty,omega star
Note
Incomplete
Jul 22, 2025
Ladner's Theorem
Note
Incomplete
Jul 22, 2025
Lambda Calculus Evaluation Rules
Note
Jul 22, 2025
Lambda Calculus Introduction
Note
Jul 22, 2025
Lambda Calculus Syntax
Note
Jul 22, 2025
Lambda Mu Calculus
Note
Incomplete
Jul 22, 2025
Lambda Term In Combinatory Logic
Note
Jul 22, 2025
Lamport's Bakery Lock
Note
Incomplete
Jul 22, 2025
Language Operations on Monoids
Note
Incomplete
Jul 22, 2025
Language of Infinite words
Note
Jul 22, 2025
Largest common independent set of a matroid
Note
Incomplete
Jul 22, 2025
Lattice Graphs
Note
Incomplete
Jul 22, 2025
Lattice
Incomplete
Note
Jul 22, 2025
Lebesgue Number Lemma
Note
Jul 22, 2025
Left and Right Adjoints are Unique
Note
Incomplete
Jul 22, 2025
Left and Right Inverses of Ring Homomorphisms
Note
Jul 22, 2025
Left and Right Inverses
Note
Jul 22, 2025
Legendre Symbol
Note
Jul 22, 2025
Joint Distribution Measure and Product of Probability
Note
Jul 22, 2025
Karger's min-cut algorithm
Note
Incomplete
Jul 22, 2025
Karger, Klein and Tarjan's Algorithm
Note
Jul 22, 2025
Karp-Lipton Theorem
Note
Incomplete
Jul 22, 2025
Kernel and Cokernels in R-Mod
Note
Jul 22, 2025
Kernels and Cokernels
Note
Jul 22, 2025
Kleene Shutzenberger Theorem
Note
Incomplete
Jul 22, 2025
Kneser Graph
Note
Jul 22, 2025
Kolmogorov Property
Note
Jul 22, 2025
Kolmogorov Translation
Note
Incomplete
Jul 22, 2025
Kripke Models
Note
Jul 22, 2025
Krull Dimension
Note
Incomplete
Jul 22, 2025
Kruskal's Algorithm
Note
Jul 22, 2025
L Rank of a constructible set
Note
Incomplete
Jul 22, 2025
L is a Model of ZFC + GCH
Note
Incomplete
Jul 22, 2025
L is a Model of ZFC
Note
Incomplete
Jul 22, 2025
L is a model of ZF
Note
Incomplete
Jul 22, 2025
L* Learning Algorithm
Note
Jul 22, 2025
L* example
Note
Incomplete
Jul 22, 2025
LFPsimult = LFP
Note
Incomplete
Jul 22, 2025
Inductive Types are Initial Algebras
Note
Incomplete
Jul 22, 2025
Inductive Types
Note
Jul 22, 2025
Infinte product and coproduct of modules do not coincide
Note
Incomplete
Jul 22, 2025
Inhomogenous Linear Systems
Note
Jul 22, 2025
Initial, Terminal and Zero Objects
Note
Jul 22, 2025
Integers in Simply Typed Lambda Calculus
Note
Jul 22, 2025
Integral Curves
Note
Jul 22, 2025
Integral Domain
Note
Incomplete
Jul 22, 2025
Integrality Gap
Note
Jul 22, 2025
Integration (Measure Theory)
Note
Jul 22, 2025
Intermediate Value Theorem
Note
Jul 22, 2025
Interval (HoTT)
Note
Jul 22, 2025
Interval implies Function Extensionality
Note
Incomplete
Jul 22, 2025
Interval is Contractible
Note
Jul 22, 2025
Intuitionistic Logic
Note
Jul 22, 2025
Invariant Queries
Note
Incomplete
Jul 22, 2025
Inverse Limits and Direct Limts
Note
Jul 22, 2025
Irrefutable let(rec)
Note
Incomplete
Jul 22, 2025
Irrefutable let(rec)s to Simple let(rec)s
Note
Incomplete
Jul 22, 2025
Isolating Cut Heuristic for Multicut Problem
Note
Incomplete
Jul 22, 2025
Isomorphism Between First Order Interpretations
Note
Jul 22, 2025
Isomorphism Types of Models
Note
Jul 22, 2025
Isomorphisms (Category Theory)
Note
Jul 22, 2025
Jacobi Sums
Note
Jul 22, 2025
Job Scheduling Problem
Note
Jul 22, 2025
Johnson Graphs
Note
Jul 22, 2025
Hover Operator (Verifiction of MST)
Note
Incomplete
Jul 22, 2025
How to count
Note
Jul 22, 2025
IC3 Algrorithm
Note
Incomplete
Jul 22, 2025
INW generator for Space Bounded Computation
Note
Incomplete
Jul 22, 2025
Ideals in Quotients
Note
Incomplete
Jul 22, 2025
Ideals in a Monoid
Note
Incomplete
Jul 22, 2025
Ideals
Note
Incomplete
Jul 22, 2025
Identity Functor admits a limit iff there is an initial object
Note
Jul 22, 2025
Identity System at a point
Note
Jul 22, 2025
Identity System
Note
Jul 22, 2025
Identity Type
Note
Jul 22, 2025
Identity Types form an Inductive Family
Note
Incomplete
Jul 22, 2025
Identity is an Equivalence
Note
Jul 22, 2025
If C is Complete and Cocomplete, so are the slice and coslice categories over C
Note
Incomplete
Jul 22, 2025
If R is a PID then submodules of free module over R are free
Note
Jul 22, 2025
If R is noetherian and M is finitely generated then M is noetherian
Note
Incomplete
Jul 22, 2025
Image of a Regular Language under a Sequential Transducer is Regular
Note
Jul 22, 2025
Immerman–Szelepcsényi Theorem
Note
Incomplete
Jul 22, 2025
Immerman–Vardi's Theorem
Note
Incomplete
Jul 22, 2025
Implementation of Sets and Set Operations
Note
Incomplete
Jul 22, 2025
Inapproximability of Max Independent Set
Note
Incomplete
Jul 22, 2025
Incidence Matrix
Note
Jul 22, 2025
Higher Groupoid Structure of Natural Numbers
Note
Jul 22, 2025
Higher Groupoid Structure of Pi Type
Note
Jul 22, 2025
Higher Groupoid Structure of Sigma Type
Note
Jul 22, 2025
Higher Groupoid Structure of Unit Type
Note
Jul 22, 2025
Higher Groupoids Structure of Coproducts
Note
Jul 22, 2025
Higher Inductive Types
Note
Jul 22, 2025
Hilbert's Basis Theorem
Note
Jul 22, 2025
Hilbert's cube
Note
Jul 22, 2025
History(Concurrent Programming)
Note
Incomplete
Jul 22, 2025
Hoare Logic
Note
Incomplete
Jul 22, 2025
Homeomorphisms
Note
Jul 22, 2025
Homogenous Linear Systems
Note
Jul 22, 2025
Homology
Note
Jul 22, 2025
Homotopy Equivalence
Note
Jul 22, 2025
Homotopy Group
Note
Incomplete
Jul 22, 2025
Homotopy Induction
Note
Jul 22, 2025
Homotopy Inductive Types
Note
Jul 22, 2025
Homotopy of paths
Note
Jul 22, 2025
Homotopy(HoTT)
Note
Jul 22, 2025
Good Samaritan vs the Minimally Decent Samaritan
Note
Incomplete
Jul 22, 2025
Graph Connectivity is not Hanf-Local
Note
Incomplete
Jul 22, 2025
Green's Lemma
Note
Incomplete
Jul 22, 2025
Green's Relations
Note
Incomplete
Jul 22, 2025
Green's Theorem
Note
Incomplete
Jul 22, 2025
Group Testing problem
Note
Incomplete
Jul 22, 2025
Group-Free Semi-group
Note
Incomplete
Jul 22, 2025
Groupoids
Note
Jul 22, 2025
Gurevich-Shelah's Theorem
Note
Incomplete
Jul 22, 2025
Guruswami-Sudan's list decoding of RS codes
Note
Incomplete
Jul 22, 2025
Gödel's system T
Note
Jul 22, 2025
HNN - Extensions
Note
Incomplete
Jul 22, 2025
Half Adjoint Equivalences are Mere Propositions
Note
Jul 22, 2025
Half Adjoint Equivalences
Note
Jul 22, 2025
Hamming Bound
Note
Jul 22, 2025
Hamming Codes
Note
Jul 22, 2025
Hamming Distance
Note
Jul 22, 2025
Hanf-Locality
Note
Jul 22, 2025
Hanf-local Queries are Gaifman-local
Note
Incomplete
Jul 22, 2025
Hardness of LTL Model Checking using Timed Automata
Note
Jul 22, 2025
Hausdorff Property
Note
Jul 22, 2025
Hereditarily Finite Sets
Note
Jul 22, 2025
Heyting Algebra
Note
Jul 22, 2025
Higher Groupoid Structure of Cartesian Product
Note
Jul 22, 2025
Higher Groupoid Structure of Identity Types
Note
Jul 22, 2025
Functions as Functors of 2 Category
Note
Incomplete
Jul 22, 2025
Functions as Functors
Note
Jul 22, 2025
Functions types to isomorphic types are isomorphic
Note
Jul 22, 2025
Functor Categories inherit Limits and Colimits object-wise
Note
Jul 22, 2025
Functors
Note
Jul 22, 2025
Fundamental Group
Note
Jul 22, 2025
Fundamental Groupoid
Note
Jul 22, 2025
Gaifman Graph
Note
Incomplete
Jul 22, 2025
Gaifman Theorem
Note
Jul 22, 2025
Gaifman-Locality implies BNDP
Note
Jul 22, 2025
Gaifman-Locality
Note
Incomplete
Jul 22, 2025
Galois Correspondence
Note
Jul 22, 2025
Galois Extensions
Note
Jul 22, 2025
Game for Counting Logic
Note
Jul 22, 2025
Gameplay for Games on Graphs
Note
Jul 22, 2025
Games of Graphs with Fixed Points
Note
Jul 22, 2025
Gauss sums
Note
Jul 22, 2025
General Adjoint Functor Theorem
Note
Jul 22, 2025
Generalized Steiner Tree-Forest Problem
Note
Jul 22, 2025
Generating Effects
Note
Jul 22, 2025
Generating Functions
Note
Jul 22, 2025
Generic Extensions of Set Theory Models
Note
Incomplete
Jul 22, 2025
Generously Transitive
Note
Jul 22, 2025
Geometric Propositional Logic
Note
Jul 22, 2025
Good Kernels
Note
Jul 22, 2025
Fixed Points
Note
Incomplete
Jul 22, 2025
Forbidden Ideal of an element in a Monoid
Note
Incomplete
Jul 22, 2025
Forgetful functor from comma category strictly creates limits
Note
Jul 22, 2025
Formal Description of a 2-DFA
Note
Jul 22, 2025
Formalising Precision and Fitness for Time Petri Nets
Note
Jul 22, 2025
Forward Reachability Tree
Note
Incomplete
Jul 22, 2025
Fourier Series
Note
Jul 22, 2025
Fourier series is the best approximation
Note
Jul 22, 2025
Fractional Tree Packing
Note
Incomplete
Jul 22, 2025
Fragments of Second Order Logic
Note
Incomplete
Jul 22, 2025
Frames(Algebra)
Note
Incomplete
Jul 22, 2025
Frechet Property
Note
Jul 22, 2025
Fredmen and Tarjan's Algorithm
Note
Incomplete
Jul 22, 2025
Free Abelian Group
Note
Jul 22, 2025
Free Algebra
Note
Jul 22, 2025
Free Group
Note
Jul 22, 2025
Free Module
Note
Jul 22, 2025
Free Monoid
Note
Jul 22, 2025
Freyd's Representability Theorem
Note
Jul 22, 2025
Fully Faithful Functors Reflect Limits and Colimits
Note
Jul 22, 2025
Fully Faithful Functors and Adjunctions
Note
Jul 22, 2025
Function Type
Note
Jul 22, 2025
Functions Computable in Lambda Calculus
Note
Jul 22, 2025
Functions as Equivalences
Note
Jul 22, 2025
Field (Measure Theory)
Note
Incomplete
Jul 22, 2025
Fields
Note
Jul 22, 2025
Filter Lock
Note
Jul 22, 2025
Filtered Category
Note
Incomplete
Jul 22, 2025
Filtered Colimits commute with finite limits in Set
Note
Jul 22, 2025
Filtered Probability Space
Note
Incomplete
Jul 22, 2025
Filters in Heyting Algebras
Note
Jul 22, 2025
Filters
Note
Jul 22, 2025
Filtrations (Measure Theory)
Note
Incomplete
Jul 22, 2025
Finding the Downward Closure of Some Languages
Note
Incomplete
Jul 22, 2025
Finite Essentially Uninterpreted (FEU) fragment
Note
Incomplete
Jul 22, 2025
Finite Fields
Note
Jul 22, 2025
Finite Integral Domains are Fields
Note
Incomplete
Jul 22, 2025
Finite Intersection Property
Note
Jul 22, 2025
Finite Monoids and idempotent elements in big words
Note
Jul 22, 2025
Finite Sat for FOL Motivation
Note
Jul 22, 2025
Finite Sat for FOL
Note
Incomplete
Jul 22, 2025
Finite Type Algebra
Note
Jul 22, 2025
Finite Variable Logics
Note
Incomplete
Jul 22, 2025
Finitely Satisfiable and Valid Sentences
Note
Jul 22, 2025
First Countable space
Note
Jul 22, 2025
First Order Logic
Note
Jul 22, 2025
Fixed Parameter Tractibility
Note
Jul 22, 2025
Fixed Point Logics are subsumed by Finite Variable Logics
Note
Incomplete
Jul 22, 2025
Fixed Point Logics
Note
Jul 22, 2025
Extension Field
Note
Jul 22, 2025
Exterior Algebra
Note
Jul 22, 2025
Exterior Differentiation
Note
Jul 22, 2025
Extrapolation for Zone Automata
Note
Incomplete
Jul 22, 2025
FO Queries are Hanf Local
Note
Incomplete
Jul 22, 2025
FO on Finite Words accepts Star Free Languages
Note
Incomplete
Jul 22, 2025
FO with Infinitary Connectives
Note
Jul 22, 2025
FO(+, *)
Note
Incomplete
Jul 22, 2025
FO(All) is in AC0
Note
Incomplete
Jul 22, 2025
FO(All)
Note
Incomplete
Jul 22, 2025
FO(Cnt)
Note
Jul 22, 2025
FOL Inexpressibility
Note
Incomplete
Jul 22, 2025
FOL-Examples for Definability
Note
Incomplete
Jul 22, 2025
Factorization Forest Theorem
Note
Incomplete
Jul 22, 2025
Fagin's Theorem
Note
Jul 22, 2025
Failure of CH in a suitable Model
Note
Incomplete
Jul 22, 2025
Farkas' Lemma
Note
Incomplete
Jul 22, 2025
Fejer Kernel
Note
Jul 22, 2025
Fiber of first projection of Sigma Types
Note
Jul 22, 2025
Fibers (HoTT)
Note
Jul 22, 2025
Fibers of Half Adjoint Equivalences are Contractible
Note
Jul 22, 2025
Fibonacci Heap
Note
Incomplete
Jul 22, 2025
Examples of Matroids
Note
Jul 22, 2025
Examples of Natural Transformation
Note
Jul 22, 2025
Examples of Rings
Note
Incomplete
Jul 22, 2025
Existence and uniqueness for linear systems
Note
Jul 22, 2025
Existence of Gomory-Hu trees
Note
Incomplete
Jul 22, 2025
Expander Graphs and Applications
Note
Incomplete
Jul 22, 2025
Expander Graphs
Note
Incomplete
Jul 22, 2025
Expander Mixing Lemma
Note
Incomplete
Jul 22, 2025
Exponential Generating Functions
Note
Jul 22, 2025
Exponential of a Matrix
Note
Jul 22, 2025
Expressability of One-Clock Alternating Timed Automata
Note
Incomplete
Jul 22, 2025
Expressing Transitive Closure with Fixed Points
Note
Jul 22, 2025
Expression Complexity of a Logic
Note
Incomplete
Jul 22, 2025
Expressive Power Of Event Clock Automata
Note
Jul 22, 2025
Expressive Power of Gödel's system T
Note
Jul 22, 2025
Extending FO
Note
Jul 22, 2025
Equivalences Reflect, Preserve and Create Colimits
Note
Jul 22, 2025
Equivalent Definitions of Adjuctions
Note
Jul 22, 2025
Error Correcting Codes
Note
Jul 22, 2025
Error Reduction for RP algorithms
Note
Incomplete
Jul 22, 2025
Evaluating Pattern Matching in Lambda Calculus
Note
Jul 22, 2025
Even Atoms in Boolean Algebras
Note
Jul 22, 2025
Even is (MSO + <)-expressible
Note
Incomplete
Jul 22, 2025
Even is not FO-definable for Linear Orders
Note
Incomplete
Jul 22, 2025
Even is not MSO-expressible
Note
Jul 22, 2025
Event Clock Automata
Note
Jul 22, 2025
Event Predicting Automata
Note
Jul 22, 2025
Event Recording Automata
Note
Jul 22, 2025
Every Finite Semi Group has an idempotent element
Note
Incomplete
Jul 22, 2025
Exact Sequences
Note
Jul 22, 2025
Examples of Coequalizers
Note
Incomplete
Jul 22, 2025
Examples of Equalizers
Note
Incomplete
Jul 22, 2025
Examples of Equivalence of Categories
Note
Incomplete
Jul 22, 2025
Examples of FO(Cnt)
Note
Incomplete
Jul 22, 2025
Emptiness Of Support
Note
Jul 22, 2025
Emptiness for Updatable Timed Automata
Note
Incomplete
Jul 22, 2025
Empty Rule for Match Function
Note
Jul 22, 2025
Emulating a Multi-tape Turing machine on a Single Tape Turing Machine Effeciently
Note
Jul 22, 2025
Encoding Finite Model
Note
Incomplete
Jul 22, 2025
Encoding and Decoding Functions
Note
Jul 22, 2025
Encoding for Proposition Formulas
Note
Jul 22, 2025
Encoding of Tuples
Note
Incomplete
Jul 22, 2025
Enriched Lambda Calculus
Note
Jul 22, 2025
Enumeration Machine
Note
Jul 22, 2025
Equality in Tropical Weighted Automata
Note
Incomplete
Jul 22, 2025
Equality of Semigroups
Note
Jul 22, 2025
Equalizers and Coequalizers
Note
Jul 22, 2025
Equational form of LP
Note
Jul 22, 2025
Equations over Finite Fields
Note
Jul 22, 2025
Equivalence Induction
Note
Jul 22, 2025
Equivalence between Machines
Note
Incomplete
Jul 22, 2025
Equivalence of Categories
Note
Incomplete
Jul 22, 2025
Equivalence of Definitions of Universal Property
Note
Jul 22, 2025
Equivalence of Rational Relations is Undecidable
Note
Jul 22, 2025
Equivalence of more complicated structures - Semi-groups
Note
Jul 22, 2025
Distances in Graphs
Note
Jul 22, 2025
Division Ring
Note
Incomplete
Jul 22, 2025
Doob Decomposition Theorem
Note
Incomplete
Jul 22, 2025
Doob's Martingale Convergence Theorem
Note
Incomplete
Jul 22, 2025
Doob's Maximal Inequality
Note
Incomplete
Jul 22, 2025
Doob's Upcrossings Inequality
Note
Incomplete
Jul 22, 2025
Double Negation Does Not Cancel
Note
Jul 22, 2025
Duality Theorems for LP
Note
Incomplete
Jul 22, 2025
Duality
Note
Jul 22, 2025
Dualling Both Categories in an Adjunctions
Note
Jul 22, 2025
EXP (Complexity Class)
Note
Jul 22, 2025
Eckmann-Hilton
Note
Jul 22, 2025
Edmond's algorithm for general Matching
Note
Incomplete
Jul 22, 2025
Edmonds-Karp algo for max flow
Note
Incomplete
Jul 22, 2025
Ehrenfeucht-Fraïssé Game for MSO
Note
Incomplete
Jul 22, 2025
Ehrenfeucht-Fraïssé Game
Note
Incomplete
Jul 22, 2025
Ehrenfeucht-Fraïssé Games Proof
Note
Jul 22, 2025
Ehrenfeucht-Fraïssé Theorem
Note
Jul 22, 2025
Element Category is Isomorphic to Comma Category
Note
Jul 22, 2025
Element Category
Note
Jul 22, 2025
Elementary Functions
Note
Jul 22, 2025
Ellipsoid Algorithm
Note
Incomplete
Jul 22, 2025
Deformation Retracts
Note
Jul 22, 2025
Degree of a Structure (FMT)
Note
Jul 22, 2025
Delta0 Formulas
Note
Incomplete
Jul 22, 2025
Denotational Semantics for lambda Calculus
Note
Jul 22, 2025
Dependency analysis for letrec expressions
Note
Incomplete
Jul 22, 2025
Dependent Function Type
Note
Jul 22, 2025
Dependent Pair Types
Note
Jul 22, 2025
Dependent Types
Note
Incomplete
Jul 22, 2025
Determinants
Note
Jul 22, 2025
Deterministic Rabin Automata accept omega-regular languages
Note
Jul 22, 2025
Deterministic Timed Automata
Note
Jul 22, 2025
Diagram
Note
Jul 22, 2025
Dice Example
Note
Jul 22, 2025
Diff Eq - Nice Info
Note
Jul 22, 2025
Dimension of a Path
Note
Incomplete
Jul 22, 2025
Dinic's algo for max-flow
Note
Incomplete
Jul 22, 2025
Dinur's Theorem
Note
Incomplete
Jul 22, 2025
Direct sum of Modules
Note
Jul 22, 2025
Dirichlet Kernels
Note
Jul 22, 2025
Discriminant of an n-tuple
Note
Jul 22, 2025
Distance Functions for Timed Traces on Petri Nets
Note
Jul 22, 2025
Distance of a Code
Note
Jul 22, 2025
Coq Basics
Note
Incomplete
Jul 22, 2025
Correspondence of Topological and Probabilistic Semantics for LTL
Note
Jul 22, 2025
Countably Compact
Note
Jul 22, 2025
Counter Automata
Note
Jul 22, 2025
Counting and Locality
Note
Jul 22, 2025
Coverability in Petri Nets is Decidable
Note
Incomplete
Jul 22, 2025
Covering Spaces
Note
Jul 22, 2025
Curry Howard Isomorphism
Note
Incomplete
Jul 22, 2025
Curry-Style typing
Note
Jul 22, 2025
Cyclically Reduced Term
Note
Jul 22, 2025
Cyclotomic Fields
Note
Jul 22, 2025
DTIME(f) Complexity Class
Note
Jul 22, 2025
Data Complexity of a Logic
Note
Incomplete
Jul 22, 2025
Deadlock-freeness
Note
Jul 22, 2025
Decidability (HoTT)
Note
Jul 22, 2025
Decidability of Finitely Satisfiability and Validity
Note
Incomplete
Jul 22, 2025
Decidability of Presburger Arithmetic
Note
Jul 22, 2025
Dedekind Domains
Note
Jul 22, 2025
Definable Formulas are Countable
Note
Incomplete
Jul 22, 2025
Definable Formulas
Note
Jul 22, 2025
Definable Power Set
Note
Incomplete
Jul 22, 2025
Definablity of Even Atoms
Note
Jul 22, 2025
Connectivity is not FO definable for Finite Graphs
Note
Incomplete
Jul 22, 2025
Consensus Number for Compare and Set - Omega
Note
Incomplete
Jul 22, 2025
Consensus Number of Atomic Read Write Registers - 1
Note
Jul 22, 2025
Consensus Number of Atomic Read Write Registers and Atomic Queue - 2
Note
Incomplete
Jul 22, 2025
Consensus
Note
Jul 22, 2025
Constant Pattern to Lambda Calculus
Note
Incomplete
Jul 22, 2025
Constructable Sets
Note
Incomplete
Jul 22, 2025
Constructible Numbers
Note
Jul 22, 2025
Construction of Syntactic Monoid of an Automata
Note
Jul 22, 2025
Constructor Rule for Match Function
Note
Jul 22, 2025
Continuous Functions
Note
Jul 22, 2025
Continuous and Cocontinuous Functor
Note
Jul 22, 2025
Continuum Hypothesis
Note
Incomplete
Jul 22, 2025
Contractible Fibers
Note
Jul 22, 2025
Contractible Types
Note
Jul 22, 2025
Convergence of Fourier Series
Note
Jul 22, 2025
Convergence of a Sequence of Martingles
Note
Incomplete
Jul 22, 2025
Converting Case Expressions to Ordinary Lambda Calculus
Note
Incomplete
Jul 22, 2025
Converting Enriched Lambda Calculus to Ordinary Lambda Calculus
Note
Incomplete
Jul 22, 2025
Convolutions
Note
Jul 22, 2025
Cook-Levin Theorem
Note
Incomplete
Jul 22, 2025
Coproducts in Category Theory
Note
Jul 22, 2025
Complexity Classes
Note
Jul 22, 2025
Complexity of FO(Cnt)All
Note
Incomplete
Jul 22, 2025
Complexity of FO
Note
Incomplete
Jul 22, 2025
Complexity of KKT Algorithm
Note
Jul 22, 2025
Complexity of MSO over Bounded Tree-Width Structures
Note
Incomplete
Jul 22, 2025
Complexity of MSO
Note
Incomplete
Jul 22, 2025
Complexity of Model Checking in Monadic Second Order Logic
Note
Jul 22, 2025
Composite Field
Note
Jul 22, 2025
Composition of Adjunctions
Note
Incomplete
Jul 22, 2025
Composition of Sequential Transducers
Note
Jul 22, 2025
Computable and Uncomputable Functions
Note
Jul 22, 2025
Computation Tree Logic
Note
Jul 22, 2025
Computational History
Note
Jul 22, 2025
Computing m_q
Note
Jul 22, 2025
Concrete Categories
Note
Jul 22, 2025
Concurrent Registers
Note
Incomplete
Jul 22, 2025
Conditional Expectation
Note
Incomplete
Jul 22, 2025
Cones and Cocones
Note
Incomplete
Jul 22, 2025
Cones and Suspensions (Topology)
Note
Jul 22, 2025
Conformality Transformation on let(rec) expressions
Note
Incomplete
Jul 22, 2025
Connectedness
Note
Jul 22, 2025
Connectivity is not EMSO definable but is AMSO
Note
Incomplete
Jul 22, 2025
Connectivity is not FO Definable
Note
Incomplete
Jul 22, 2025
Combinatorial Proofs
Note
Jul 22, 2025
Combinatorial Optimisation
Note
Incomplete
Jul 22, 2025
Combinatory Logic
Note
Jul 22, 2025
Combined Complexity of a Logic
Note
Incomplete
Jul 22, 2025
Communication Free Petri-Net
Note
Incomplete
Jul 22, 2025
Commutative Ring
Note
Incomplete
Jul 22, 2025
Commuting of Rectangles and Squares
Note
Jul 22, 2025
Compactness
Note
Jul 22, 2025
Complete Lattice
Note
Incomplete
Jul 22, 2025
Complete and Cocomplete Categories
Note
Jul 22, 2025
Complete or Cocomplete k-small categories are pre-order
Note
Jul 22, 2025
Complete problem for NL
Note
Incomplete
Jul 22, 2025
Completion of a Measure Space
Note
Incomplete
Jul 22, 2025
Complex Convergence Results
Note
Jul 22, 2025
Complex Numbers as quotients of polynomial ring over Reals
Note
Incomplete
Jul 22, 2025
Complex Numbers
Note
Jul 22, 2025
Complex Polynomials
Note
Jul 22, 2025
Complex Rational Functions
Note
Jul 22, 2025
Chain Complex
Note
Jul 22, 2025
Channel Systems
Note
Jul 22, 2025
Characterisic of a field
Note
Jul 22, 2025
Checking if a word is related to Sigma*
Note
Incomplete
Jul 22, 2025
Choosing Limits of diagrams in Functorial
Note
Incomplete
Jul 22, 2025
Church Booleans
Note
Jul 22, 2025
Church Numerals
Note
Jul 22, 2025
Church-Style typing
Note
Jul 22, 2025
Circle (HoTT)
Note
Jul 22, 2025
Circuit Value Problem
Note
Incomplete
Jul 22, 2025
Circulant Graphs
Note
Jul 22, 2025
Closed Category
Note
Incomplete
Jul 22, 2025
Closed sets
Note
Jul 22, 2025
Closure Properties of Büchi Automata and Omega-regular languages
Note
Jul 22, 2025
Closure Properties of Rational Relations
Note
Incomplete
Jul 22, 2025
Closure Properties of Recognizable functions
Note
Incomplete
Jul 22, 2025
Closure and Interior and Limit Points
Note
Jul 22, 2025
Co-NP (Complexity Class)
Note
Incomplete
Jul 22, 2025
Cofinality
Note
Incomplete
Jul 22, 2025
Coherence Spaces
Note
Jul 22, 2025
Coherence Types for Equivalences
Note
Jul 22, 2025
Coin Example
Note
Incomplete
Jul 22, 2025
Colimit of Limits gives Limit fo Colimit of a Bifunctor
Note
Jul 22, 2025
CLH queue Lock
Note
Jul 22, 2025
CTL*
Note
Incomplete
Jul 22, 2025
Caley Graphs
Note
Jul 22, 2025
Can there be sparse sets that are NP-hard?
Note
Incomplete
Jul 22, 2025
Cannonical Decomposition of Module Homomorphisms
Note
Jul 22, 2025
Cannonical Decomposition of Ring Homomorphisms
Note
Incomplete
Jul 22, 2025
Cardinal Arithmetic
Note
Incomplete
Jul 22, 2025
Cardinality of a small category
Note
Jul 22, 2025
Cardinals Pre-reqs
Note
Jul 22, 2025
Cardinals
Note
Jul 22, 2025
Cartesian Closed Category
Note
Jul 22, 2025
Cat and CAT are complete and Cocomplete
Note
Jul 22, 2025
Categorization of Equivalent Categories
Note
Incomplete
Jul 22, 2025
Category Theory Introduction Page
Note
Jul 22, 2025
Category of Modules
Note
Jul 22, 2025
Category
Note
Jul 22, 2025
Cauchy-Reimann Equation
Note
Jul 22, 2025
Cesaro Summability
Note
Jul 22, 2025
Bi-invertible Maps
Note
Jul 22, 2025
Bijective Ehrenfeucht-Fraïssé Game
Note
Incomplete
Jul 22, 2025
Binary Heaps
Note
Incomplete
Jul 22, 2025
Binomial Heaps
Note
Incomplete
Jul 22, 2025
Bipartite Expander Graphs
Note
Incomplete
Jul 22, 2025
Bipartite Graph Perfect Matching
Note
Incomplete
Jul 22, 2025
Block-Graph Theory
Note
Jul 22, 2025
Boolean Algebra
Note
Jul 22, 2025
Boolean Circuits
Note
Incomplete
Jul 22, 2025
Boolean Type
Note
Jul 22, 2025
Borel Sigma Field
Note
Incomplete
Jul 22, 2025
Borsuk Ulam Theorem
Note
Jul 22, 2025
Boruvka's Algorithm
Note
Jul 22, 2025
Both Directions of Half Adjoints are Logically Equivalent
Note
Jul 22, 2025
Bounded Number of Degrees Property
Note
Jul 22, 2025
Bounded Wait-freeness
Note
Jul 22, 2025
Brouwer's Fixed Point Theorem
Note
Jul 22, 2025
Building of Assignment Tester
Note
Incomplete
Jul 22, 2025
Burnside's Lemma
Note
Jul 22, 2025
Büchi Automata for Linear Temporal Logic
Note
Incomplete
Jul 22, 2025
Büchi Automata for Monadic Second Order Logic
Note
Jul 22, 2025
Büchi Automata
Note
Jul 22, 2025
The matching polytope has exponential extension complexity
Note
Incomplete
Jul 22, 2025
Arc-Transitivity of a Graph
Note
Jul 22, 2025
Arden's Lemma
Note
Incomplete
Jul 22, 2025
Arenas for Games on Graphs
Note
Jul 22, 2025
Arithmetic Operators are Definable in LFP
Note
Jul 22, 2025
Arrow Type
Note
Jul 22, 2025
Ascending Chain Condition
Note
Jul 22, 2025
Associates in Rings
Note
Jul 22, 2025
Asymmetric Graphs
Note
Jul 22, 2025
Atomic Types
Note
Jul 22, 2025
Atomization of Programs
Note
Jul 22, 2025
Automorphism Group of a Graph
Note
Jul 22, 2025
Autonomous System
Note
Jul 22, 2025
Axiom of Choice and its Variants
Note
Incomplete
Jul 22, 2025
Axiom of Constructibility
Note
Incomplete
Jul 22, 2025
Axioms Satisfied in M[G]
Note
Incomplete
Jul 22, 2025
Axioms for Higher Order Theory of Reals
Note
Incomplete
Jul 22, 2025
Axioms of ZFC
Note
Jul 22, 2025
BPP Complexity Class
Note
Jul 22, 2025
Backoff Lock
Note
Jul 22, 2025
Banach-Mazur Games
Note
Incomplete
Jul 22, 2025
Based Path Induction
Note
Jul 22, 2025
Bases for a topology
Note
Jul 22, 2025
Basic Feasible Solution
Note
Jul 22, 2025
Basic ways to prove things using coq
Note
Incomplete
Jul 22, 2025
Algebraic Extension
Note
Jul 22, 2025
Algebraic Integers
Note
Jul 22, 2025
Algorithm for Arborescence
Note
Incomplete
Jul 22, 2025
Algorithm for Finding the Weight of a Word
Note
Jul 22, 2025
Algorithmic Coding Theory Lec 1
Note
Rename
Jul 22, 2025
Almost All Automorphism Groups are Trivial
Note
Jul 22, 2025
Alt
Note
Jul 22, 2025
Alternating Finite Automaton
Note
Jul 22, 2025
Alternating Timed Automata
Note
Jul 22, 2025
Alternating Turing Machine
Note
Incomplete
Jul 22, 2025
Amdahl's Law
Note
Jul 22, 2025
Analytic Function
Note
Jul 22, 2025
Anderson's Lock
Note
Jul 22, 2025
Another way to Complement a Büchi Autromata
Note
Jul 22, 2025
Any Category with Coproducts and Coequalizers is Cocomplete, with Products and Equalizers is Complete
Note
Jul 22, 2025
Any Equivalence can be promoted to an Adjunction
Note
Incomplete
Jul 22, 2025
Any category with Pullback and a terminal object has all finite limits, with pushouts and an initial object has all finite colimits
Note
Jul 22, 2025
Aperiodic Languages are Star Free Regular
Note
Incomplete
Jul 22, 2025
Aperiodic Monoids recognize all FO Definable Languages
Note
Incomplete
Jul 22, 2025
Application of Static Analysis
Note
Jul 22, 2025
Applications of Error Correcting Codes
Note
Incomplete
Jul 22, 2025
Approximation Algorithms
Note
Jul 22, 2025
Arborescence
Note
Jul 22, 2025
A More Efficient Method for Petri Net Coverability
Note
Incomplete
Jul 22, 2025
A Poset is a complete and cocomplete category iff it is a complete lattice
Note
Jul 22, 2025
A Proof System for FOL
Note
Incomplete
Jul 22, 2025
A better Axiom of Choice for Type Theory
Note
Jul 22, 2025
A complete, locally small category with a jointly weakly initial set of objects has an initial object
Note
Jul 22, 2025
A functor admits a left adjoint iff all its comma categories have an initial object
Note
Jul 22, 2025
A locally small, complete category with a small coseparator and intersections of all collections of subobjects has an initial object
Note
Jul 22, 2025
A natural isomorphism between diagrams induces an isomorphism between limits and colimits
Note
Jul 22, 2025
AC0
Note
Incomplete
Jul 22, 2025
APX (Complexity Class)
Note
Incomplete
Jul 22, 2025
Abelian Groups
Note
Jul 22, 2025
Absoluteness of Formulas
Note
Incomplete
Jul 22, 2025
Acyclicity of Graphs is Definable in LFP
Note
Incomplete
Jul 22, 2025
Adjacency Algebra of a Graph
Note
Jul 22, 2025
Adjoint Functor Theorem for locally presentable categories
Note
Jul 22, 2025
Adjoints of Inclusion functor from Ring to Rng
Note
Jul 22, 2025
Adjunction of Bifunctors
Note
Jul 22, 2025
Adjunctions in Functor Categories
Note
Incomplete
Jul 22, 2025
Adjunctions in Posets
Note
Jul 22, 2025
Adjunctions
Note
Jul 22, 2025
Alg3 class
Note
Jul 22, 2025
Algebraic Classification of Recognizable functions
Note
Jul 22, 2025
Algebraic Closure
Note
Jul 22, 2025
(Weighted) Vertex Cover using LP
Note
Jul 22, 2025
+ is epxressible in FO(BIT, <)
Note
Incomplete
Jul 22, 2025
1-Forms
Note
Jul 22, 2025
2-Categories
Note
Jul 22, 2025
2-Way DFA
Note
Jul 22, 2025
2023-04-11
Note
Jul 22, 2025
2023-04-13
Note
Jul 22, 2025
29th LP Notes
Note
Incomplete
Jul 22, 2025
A Categorical notion of Equivalence Relation
Note
Jul 22, 2025
A Fiberwise Transformation is an Equivalence if its Total is an Equivalence
Note
Jul 22, 2025
A Language if Regular iff its Characteristic Function is regular
Note
Jul 22, 2025
Allocation Problem
Note
Incomplete