activity
20072019
most citedA sufficient condition for first order non-definability of arrowing problems

1 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LO2019

Belief revision and 3-valued logics: Characterization of 19,683 belief change operators

Nerio Borges, Ramón Pino Pérez

In most classical models of belief change, epistemic states are represented by theories (AGM) or formulas (Katsuno-Mendelzon) and the new pieces of information by formulas. The Rep…

math.CO2018

Perfectly nested circuits

María Carrasco, Zenaida Castillo, Nerio Borges +1

Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surfa…

math.CO2018

A Note on Minimal Senders

Nerio Borges

In this paper we prove that if a pair of graphs G,H have senders, then they necessarily have connected minimal senders; we also prove that given two fixed graphs that are either 3-…

cs.LO2017

A syntactic tool for proving hardness in the Second Level of the Polynomial-Time Hierarchy

Edwin Pin, Nerio Borges

In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-complet…

cs.LO2014★ 1 cited

Universal First-Order Logic is Superfluous for NL, P, NP and coNP

Nerio Borges, Blai Bonet

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertat…

cs.CC2012★ 1 cited

A sufficient condition for first order non-definability of arrowing problems

Nerio Borges

We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem…