Completeness and Decidability Results for First-Order Clauses With Indices

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-38574-2_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Blocked Clauses in First-Order Logic

English

Completeness for First-Order Properties on Sparse Structures With Algorithmic Applications

2017English

The Completeness of the First-Order Functional Calculus

Journal of Symbolic Logic
PhilosophyLogic
1949English

On Arithmetical Completeness of First-Order Logics of Provability

2002English

Complexity Results for First-Order Two-Variable Logic With Counting

SIAM Journal on Computing
MathematicsComputer Science
2000English

Controllability Results for First and Second Order Evolution Inclusions With Nonlocal Conditions

Annales Polonici Mathematici
Mathematics
2006English

Dynamic Logic for Data-Aware Systems: Decidability Results

2017English

Query Order and NP-completeness

English

Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy