Program schemes, arrays, Lindström quantifiers and zero-one laws
From MaRDI portal
(Redirected from Publication:1606129)
Recommendations
- Publication:4945239
- scientific article; zbMATH DE number 1796951
- Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
- On strictly arithmetical completeness in logics of programs
- Halting and equivalence of program schemes in models of arbitrary theories
- Zero-one laws for first-order formulas with a bounded quantifier depth
- scientific article; zbMATH DE number 3864500
- scientific article; zbMATH DE number 1272994
- scientific article; zbMATH DE number 732053
- scientific article; zbMATH DE number 139629
Cites work
- scientific article; zbMATH DE number 3889514 (Why is no real title available?)
- scientific article; zbMATH DE number 3622921 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 979011 (Why is no real title available?)
- scientific article; zbMATH DE number 1142319 (Why is no real title available?)
- scientific article; zbMATH DE number 1142324 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 827979 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- Adding for-loops to first-order logic
- An observation on time-storage trade off
- Arity hierarchies
- Complete Problems Involving Boolean Labelled Structures and Projection Transactions
- Complexity of some problems in Petri nets
- Context-sensitive transitive closure operators
- Datalog extensions for database queries and updates
- Even Simple Programs Are Hard To Analyze
- Existential least fixed-point logic and its relatives
- Generalized Quantifiers and Logical Reducibilities
- Hierarchies in classes of program schemes
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- Infinitary logics and 0-1 laws
- Languages that Capture Complexity Classes
- Logical Description of Monotone NP Problems
- Logical and schematic characterization of complexity classes
- Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic
- On Classes of Program Schemata
- On locating cubic subgraphs in bounded-degree connected bipartite graphs
- On static logics, dynamic logics, and complexity classes
- On the power of built-in relations in certain classes of program schemes
- Persistence of vector replacement systems is decidable
- Probabilities on finite models
- Relativized logspace and generalized quantifiers over finite ordered structures
- Some relationships between logics of programs and complexity theory
- Structure and complexity of relational queries
- The expressive power of stratified logic programs
- Using the Hamiltonian path operator to capture NP
Cited in
(10)- An infinite hierarchy in a class of polynomial-time program schemes
- Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
- scientific article; zbMATH DE number 1424048 (Why is no real title available?)
- Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
- On the power of deep pushdown stacks
- scientific article; zbMATH DE number 1796951 (Why is no real title available?)
- Hierarchies in classes of program schemes
- Programs over semigroups of dot-depth one
- Program Schemes with Deep Pushdown Storage
- Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
This page was built for publication: Program schemes, arrays, Lindström quantifiers and zero-one laws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606129)
