Hereditarily-finite sets, data bases and polynomial-time computability
From MaRDI portal
(Redirected from Hereditarily-finite sets, data bases and polynomial-time computability)
Recommendations
Cites work
- Bounded arithmetic and truth definition
- Computable queries for relational data bases
- Existence and feasibility in arithmetic
- Extended algebra and calculus for nested relational databases
- Fixed-point extensions of first-order logic
- Foundational studies. Selected works. Vol. I, II
- scientific article; zbMATH DE number 4179364 (Why is no real title available?)
- scientific article; zbMATH DE number 3942990 (Why is no real title available?)
- scientific article; zbMATH DE number 3966062 (Why is no real title available?)
- scientific article; zbMATH DE number 3976395 (Why is no real title available?)
- scientific article; zbMATH DE number 3980456 (Why is no real title available?)
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 4066875 (Why is no real title available?)
- scientific article; zbMATH DE number 4090786 (Why is no real title available?)
- scientific article; zbMATH DE number 4104951 (Why is no real title available?)
- scientific article; zbMATH DE number 3708375 (Why is no real title available?)
- scientific article; zbMATH DE number 3711948 (Why is no real title available?)
- scientific article; zbMATH DE number 3741382 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 43047 (Why is no real title available?)
- scientific article; zbMATH DE number 41736 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3504972 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- scientific article; zbMATH DE number 1142329 (Why is no real title available?)
- scientific article; zbMATH DE number 218550 (Why is no real title available?)
- scientific article; zbMATH DE number 3999883 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- Languages that Capture Complexity Classes
- On the scheme of induction for bounded arithmetic formulas
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- The collection principle and the existential quantifier
- The polynomial-time hierarchy
- Turing machines and the spectra of first-order formulas
Cited in
(11)- A query language for NC
- -languages for sets and LOGSPACE computable graph transformers
- Linear ordering on graphs, anti-founded sets and polynomial time computability
- Structural recursion as a query language on lists and ordered trees
- \(\Delta\): set-theoretic query language capturing LOGSPACE
- On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types
- scientific article; zbMATH DE number 4104951 (Why is no real title available?)
- ON THE COMPUTING POWER OF PROGRAMS WITH SETS
- scientific article; zbMATH DE number 1507284 (Why is no real title available?)
- Web-like databases, non-well-founded sets and inductive definability
- The theory of hereditarily bounded sets
This page was built for publication: Hereditarily-finite sets, data bases and polynomial-time computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311973)
