z-logo
open-access-imgOpen Access
Automatic Decidability for Theories with Counting Operators
Author(s) -
Elena Tushkanova,
Christophe Ringeissen,
Alain Giorgetti,
Olga Kouchnarenko
Publication year - 2013
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - schematic , decidability , fragment (logic) , modulo , satisfiability , algebra over a field , mathematics , computer science , calculus (dental) , discrete mathematics , programming language , pure mathematics , medicine , dentistry , electronic engineering , engineering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom