Amanote Research

Amanote Research

    RegisterSign In

On Arithmetical Completeness of First-Order Logics of Provability

doi 10.1142/9789812776471_0001
Full Text
Open PDF
Abstract

Available in full text

Date

September 1, 2002

Authors
ROSTISLAV E. YAVORSKY
Publisher

WORLD SCIENTIFIC


Related search

First-Order Logics of Branching Time

Logical Investigations
2013English

The Completeness of the First-Order Functional Calculus

Journal of Symbolic Logic
PhilosophyLogic
1949English

First-Order Resolution Methods for Modal Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

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

2017English

Completeness and Decidability Results for First-Order Clauses With Indices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Undecidability of Modal and Intermediate First-Order Logics With Two Individual Variables

Journal of Symbolic Logic
PhilosophyLogic
1993English

On Completeness of Root Vectors of the Cauchy Problem of the First Order Equation With Deviating Argument

PHYSICO-MATHEMATICAL SERIES
2020English

Simple Completeness Proofs for Some Spatial Logics of the Real Line

2013English

Query Order and NP-completeness

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy