research
∙
06/14/2023
A note on the complexity of addition
We show that the sum of a sequence of integers can be computed in linear...
share
research
∙
03/27/2023
A simplified lower bound for implicational logic
We present a streamlined and simplified exponential lower bound on the l...
research
∙
09/02/2022
Models of VTC^0 as exponential integer parts
We prove that (additive) ordered group reducts of nonstandard models of ...
research
∙
06/24/2022
Elementary analytic functions in VTC^0
It is known that rational approximations of elementary analytic function...
research
∙
04/14/2021
The theory of hereditarily bounded sets
We show that for any k∈ω, the structure (H_k,∈) of sets that are heredit...
research
∙
11/05/2020
Iterated multiplication in VTC^0
We show that VTC^0, the basic theory of bounded arithmetic corresponding...
research
∙
04/23/2020
On the proof complexity of logics of bounded branching
We investigate the proof complexity of extended Frege (EF) systems for b...
research
∙
09/26/2019
On the complexity of the clone membership problem
We investigate the complexity of the Boolean clone membership problem (C...
research
∙
05/30/2019
Rules with parameters in modal logic II
We analyze the computational complexity of admissibility and unifiabilit...
research
∙
09/27/2018
Induction rules in bounded arithmetic
We study variants of Buss's theories of bounded arithmetic axiomatized b...
research
∙
03/15/2018
Rigid models of Presburger arithmetic
We present a description of rigid models of Presburger arithmetic (i.e.,...
research
∙
10/26/2017
