On Complexity of Complete First-Order Theories

Mathematical Logic Quarterly - Germany
doi 10.1002/malq.19820280802
Full Text
Abstract

Available in full text

Categories
Logic
Date
Authors
Publisher

Wiley

Related search

Complexity of Existential Positive First-Order Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2011English

Non-Computable Models of Certain First Order Theories

2017English

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices
Computer Science
2015English

Relating First-Order Set Theories and Elementary Toposes

Bulletin of Symbolic Logic
PhilosophyLogic
2007English

On Ambitious Higher-Order Theories of Consciousness

Philosophical Psychology
PhilosophyApplied Psychology
2020English

The Ground-Negative Fragment of First-Order Logic Is -Complete

Journal of Symbolic Logic
PhilosophyLogic
1999English

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

SIAM Journal on Computing
MathematicsComputer Science
2000English

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2012English

Denumerable Models of Complete Theories

2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy