Fixed-point logic with counting
Statement
Question Can either of the following be expressed in fixed-point logic plus counting:
- Given a graph, does it have a perfect matching, i.e., a set of edges such that every vertex is incident to exactly one edge from ?
- Given a square matrix over a finite field (regarded as a structure in the natural way, as described in [BGS02]), what is its determinant?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.