相关论文: Typical forcings, NP search problems and an extens…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

Until now, Computer Scientists have concerned themselves with identifying efficient algorithms for solving the general case of some problem -- that is finding one which performs well when the size of the input tends to infinity. In this…

A forcing set $S$ in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in $S$. An anti-forcing set is the symmetric concept: a set $S$ of elements is called an anti-forcing set…

As machine learning applications grow increasingly ubiquitous and complex, they face an increasing set of requirements beyond accuracy. The prevalent approach to handle this challenge is to aggregate a weighted combination of requirement…

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

Strong convergence and convergence in probability were generalized to the setting of a Riesz space with conditional expectation operator, T, in [Y. Azouzi, W.-C. Kuo, K. Ramdane, B. A. Watson, Convergence in Riesz spaces with conditional…

The enterprise of comparing mathematical theorems according to their logical strength is an active area in mathematical logic. In this setting, called reverse mathematics, one investigates which theorems provably imply which others in a…

We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the Kneser-Lov\'{a}sz Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter…

We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood, we say that a…

We consider the embedding theory, the approach to gravity proposed by Regge and Teitelboim, in which 4D space-time is treated as a surface in high-dimensional flat ambient space. In its general form, which does not contain artificially…

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Recently, an interesting phenomenon called grokking has gained much attention, where generalization occurs long after the models have initially overfitted the training data. We try to understand this seemingly strange phenomenon through the…

We investigate the proof complexity of extended Frege (EF) systems for basic transitive modal logics (K4, S4, GL, ...) augmented with the bounded branching axioms $\mathbf{BB}_k$. First, we study feasibility of the disjunction property and…

Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a…

A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such…

Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…

Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…

Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…

We study formal languages which are capable of fully expressing quantitative probabilistic reasoning and do-calculus reasoning for causal effects, from a computational complexity perspective. We focus on satisfiability problems whose…