Search Results - "Wied Pakusa"

A Finite-Model-Theoretic View on Propositional Proof Complexity by Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

“…We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of…”
Get full text

Definability of linear equation systems over groups and rings by Dawar, Anuj, Kopczynski, Eryk, Holm, Bjarki, Grädel, Erich, Pakusa, Wied

“…Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this…”
Get full text

A Finite-Model-Theoretic View on Propositional Proof Complexity by Grädel, Erich, Grohe, Martin, Pago, Benedikt, Pakusa, Wied

“…Logical Methods in Computer Science, Volume 15, Issue 1 (June 14, 2022) lmcs:4320 We establish new, and surprisingly tight, connections between propositional…”
Get full text

RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC by GRÄDEL, ERICH, PAKUSA, WIED

“…Motivated by the search for a logic for polynomial time, we study rank logic (FPR) which extends fixed-point logic with counting (FPC) by operators that…”
Get full text

Descriptive complexity of linear equation systems and applications to propositional proof complexity by Grohe, Martin, Pakusa, Wied

“…We prove that the solvability of systems of linear equations and related linear algebraic properties are definable in a fragment of fixed-point logic with…”
Get full text

Definability of linear equation systems over groups and rings by Dawar, Anuj, Kopczynski, Eryk, Holm, Bjarki, Grädel, Erich, Pakusa, Wied

“…Logical Methods in Computer Science, Volume 9, Issue 4 (November 14, 2013) lmcs:725 Motivated by the quest for a logic for PTIME and recent insights that the…”
Get full text

Model-Theoretic Properties of [omega]-Automatic Structures by Zaid, Faried Abu, Grädel, Erich, Kaiser, Ukasz, Pakusa, Wied

“…Issue Title: Theoretical Aspects of Computer Science We investigate structural properties of [omega]-automatic presentations of infinite structures in order to…”
Get full text

Definability of summation problems for Abelian groups and semigroups by Abu Zaid, Faried, Dawar, Anuj, Gradel, Erich, Pakusa, Wied

“…We study the descriptive complexity of summation problems in Abelian groups and semigroups. In general, an input to the summation problem consists of an…”
Get full text

Defining Winning Strategies in Fixed-Point Logic by Canavoi, Felix, Gradel, Erich, Lessenich, Simon, Pakusa, Wied

“…We study definability questions for positional winning strategies in infinite games on graphs. The quest for efficient algorithmic constructions of winning…”
Get full text

Model-Theoretic Properties of ω-Automatic Structures by Zaid, Faried Abu, Grädel, Erich, Kaiser, Łukasz, Pakusa, Wied

“…We investigate structural properties of ω -automatic presentations of infinite structures in order to sharpen our methods to determine whether a given…”
Get full text

Characterising Choiceless Polynomial Time with First-Order Interpretations by Gradel, Erich, Pakusa, Wied, Schalthofer, Svenja, Kaiser, Lukasz

“…Choice less Polynomial Time (CPT) is one of the candidates in the quest for a logic for polynomial time. It is a strict extension of fixed-point logic with…”
Get full text

Approximations of Isomorphism and Logics with Linear-Algebraic Operators by Dawar, Anuj, Grädel, Erich, Pakusa, Wied

“…Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and…”
Get full text

Rank logic is dead, long live rank logic by Grädel, Erich, Pakusa, Wied

“…Motivated by the search for a logic for polynomial time, we study rank logic (FPR) which extends fixed-point logic with counting (FPC) by operators that…”
Get full text