On synthesizing Skolem functions for first order logic formulae

02/15/2021
by   S. Akshay, et al.
0

Skolem functions play a central role in logic, from eliminating quantifiers in first order logic formulas to providing functional implementations of relational specifications. While classical results in logic are only interested in their existence, the question of how to effectively compute them is also interesting, important and useful for several applications. In the restricted case of Boolean propositional logic formula, this problem of synthesizing Boolean Skolem functions has been addressed in depth, with various recent work focussing on both theoretical and practical aspects of the problem. However, there are few existing results for the general case, and the focus has been on heuristical algorithms. In this article, we undertake an investigation into the computational hardness of the problem of synthesizing Skolem functions for first order logic formula. We show that even under reasonable assumptions on the signature of the formula, it is impossible to compute or synthesize Skolem functions. Then we determine conditions on theories of first order logic which would render the problem computable. Finally, we show that several natural theories satisfy these conditions and hence do admit effective synthesis of Skolem functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2017

Quantifying over boolean announcements

Various extensions of public announcement logic have been proposed with ...
research
07/30/2021

Reactive Synthesis Modulo Theories Using Abstraction Refinement

Reactive synthesis builds a system from a specification given as a tempo...
research
10/16/2021

Sahlqvist Correspondence Theory for Second-Order Propositional Modal Logic

Modal logic with propositional quantifiers (i.e. second-order propositio...
research
08/22/2018

Synthesizing Set Functions

Set functions are a feature of functional logic programming to encapsula...
research
06/11/2009

Characterising equilibrium logic and nested logic programs: Reductions and complexity

Equilibrium logic is an approach to nonmonotonic reasoning that extends ...
research
08/28/1998

First-Order Conditional Logic Revisited

Conditional logics play an important role in recent attempts to formulat...
research
03/12/2023

General Boolean Formula Minimization with QBF Solvers

The minimization of propositional formulae is a classical problem in log...

Please sign up or login with your details

Forgot password? Click here to reset