4 citations · 12 across the 10 of their papers we have counts for
11 papers
Two applications of the point-free coderivative
Zoltan A. Kocsis
We present two new applications of Simmons' point-free Cantor-Bendixson coderivative operator in intuitionistic logic. First, we use it to give a simplified proof of the recent res…
Distributive lattices in o-minimal structures
Zoltan A. Kocsis
We investigate distributive lattices and Heyting algebras definable in o-minimal structures. We give a complete description of one-dimensional distributive lattices definable in o-…
The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale
Matthew Bolan, Joachim Breitner, Jose Brox +31
We report on the Equational Theories Project (ETP), an online collaborative pilot project to explore new ways to collaborate in mathematics with machine assistance. The project suc…
Proof-theoretic methods in quantifier-free definability
Zoltan A. Kocsis
We introduce a proof-theoretic approach to showing nondefinability of second-order intuitionistic connectives by quantifier-free schemata. We apply the method to prove that Taranov…
Apartness relations between propositions
Zoltan A. Kocsis
We classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which conta…
Structured Decompositions: Structural and Algorithmic Compositionality
Benjamin Merlin Bumpus, Zoltan A. Kocsis, Jade Edenstar Master +1
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidt…
Degree of Satisfiability in Heyting Algebras
Benjamin Merlin Bumpus, Zoltan A. Kocsis
Given a finite structure and property , it is a natural to study the degree of satisfiability of in ; i.e. to ask: what is the probability that uniformly randomly cho…
Treewidth via Spined Categories (extended abstract)
Zoltan A. Kocsis, Benjamin Merlin Bumpus
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes e…
Spined categories: generalizing tree-width beyond graphs
Benjamin Merlin Bumpus, Zoltan A. Kocsis
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic struct…
Degree of satisfiability of some special equations
Zoltan A. Kocsis
A well-known theorem of Gustafson states that in a non-Abelian group the degree of satisfiability of , i.e. the probability that two uniformly randomly chosen group elements…
Dependency Injection for Programming by Optimization
Zoltan A. Kocsis, Jerry Swan
Programming by Optimization tools perform automatic software configuration according to the specification supplied by a software developer. Developers specify design spaces for pro…