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

SIAM Journal on Computing - United States
doi 10.1137/s0097539797323005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Two-Variable Logic With Counting and a Linear Order

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Complexity of Existential Positive First-Order Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2011English

New Complexity Results for Łukasiewicz Logic

Soft Computing
GeometrySoftwareTheoretical Computer ScienceTopology
2018English

Literal Projection for First-Order Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

First-Order Dynamic Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1979English

A Denotational Semantics for First-Order Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Proof Planning for First-Order Temporal Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Geometrisation of First-Order Logic

Bulletin of Symbolic Logic
PhilosophyLogic
2015English

Semigroups Underlying First-Order Logic

Memoirs of the American Mathematical Society
MathematicsApplied Mathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy