scientific article; zbMATH DE number 3241254

Cited in

(only showing first 100 items - show all)

Turing oracle machines, online computing, and three displacements in computability theory
Formal systems for join dependencies
On effectively computable realizations of choice functions
Prolegomena to a theory of mechanized formal reasoning
Solvable classes of pseudoprenex formulas
Axiomatic data type specifications: A first order theory of linear lists
Existential instantiation and normalization in sequent natural deduction
Quantifier-complete categories
On rewriting sentences into formulas
We shall know: Hilbert's apology
Gödel's incompleteness theorem
A self-referential agent-based model that consists of a large number of agents moving stochastically in a discrete bounded domain.
von Neumann standard quantum mechanics is logically inconsistent
How to progress a database
Consequences of an exotic definition for \(\text{P}=\text{NP}\).
Extended normal form theorems for logical proofs from axioms
First-degree entailment and its relatives
Possible worlds and resources: The semantics of \(\mathbf{BI}\)
A note on cut-elimination for classical propositional logic
Semantics of quantum programming languages: Classical control, quantum control
Regaining cut admissibility in deduction modulo using abstract completion
Normality, non-contamination and logical depth in classical natural deduction
Index set expressions can represent temporal logic formulas
Solving strong controllability of temporal problems with uncertainty using SMT
The reachability problem in constructive geometric constraint solving based dynamic geometry
Soundness and completeness proofs by coinductive methods
A normal form for logical derivations implying one for arithmetic derivations
Succinct definitions in the first order theory of graphs
On the metamathematics of the P vs. NP question
Languages of logic and their applications
A note on inverses of elementary permutations
Conditions for Lyapunov stability
Functional equations for the functions of real variables
Two-sided sequent calculi for \textit{FDE}-like four-valued logics
Logic and mathematics
Mathematical logic.
An intensional type theory: Motivation and cut-elimination
Self-verifying axiom systems, the incompleteness theorem and related reflection principles
Some fixed-point issues in PPTL
Well-structured mathematical logic
Interpolation systems for ground proofs in automated deduction: a survey
Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
Cut elimination for GLS using the terminability of its regress process
Argumentation update in YALLA (yet another logic language for argumentation)
König's infinity lemma and Beth's tree theorem
Axioms for the set-theoretic hierarchy
European Summer Meeting of the Association for Symbolic Logic, Hull, 1986
Forcing and reducibilities
Groundwork for weak analysis
FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE
scientific article; zbMATH DE number 3115104 (Why is no real title available?)
Dynamic controllability via timed game automata
Mathematical Logic: Mathematics of Logic or Logic of Mathematics
On generalized decision functions: reducts, networks and ensembles
First-degree entailment and structural reasoning
Modal analysis of generalized rosser sentences
Fractional semantics for classical logic
Saturation and Σ₂-transfer for ERNA
Abstract Beth definability in institutions
Shoenfield is Gödel after Krivine
scientific article; zbMATH DE number 5306054 (Why is no real title available?)
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
A Natural Axiomatization of Computability and Proof of Church's Thesis
Automating theories in intuitionistic logic
Heirs of box types in polynomially bounded structures
Mass problems and measure-theoretic regularity
Grammar directed gödel numberings
Cuts, consistency statements and interpretations
A note on interpretations of many-sorted theories
Equality and lyndon's interpolation theorem
Forcing and reducibilities. III. Forcing in fragments of set theory
Finitely generic models of T_UH, for certain model companionable theories T
On Metapaths in Metagraphs
The axiom of determinacy implies dependent choices in L(R)
A boundedness theorem in ID₁(W)
On cut elimination in the presence of perice rule
Believing the axioms. II
scientific article; zbMATH DE number 3181175 (Why is no real title available?)
The theory of all substructures of a structure: Characterisation and decision problems
Theories with a finite number of countable models
Model companions and k-model completeness for the complete theories of Boolean algebras
scientific article; zbMATH DE number 3696535 (Why is no real title available?)
The metamathematics of model theory: Discovering language in action
On generalized quantifiers in arithmetic
Saturated models of Peano arithmetic
Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991
On projective ordinals
Continuity and elementary logic
Note on the Kondo-Addison theorem
Some results in modal model theory
The isomorphism property in nonstandard analysis and its use in the theory of Banach spaces
Reduction of tense logic to modal logic. I
Semi-minimal theories and categoricity
The work of Kurt Gödel
scientific article; zbMATH DE number 3584741 (Why is no real title available?)
INTELLIGENT SYSTEMS: KNOWLEDGE ASSOCIATION AND RELATED DEDUCTIVE PROCESSES
Uniform upper bounds on ideals of turing degrees
A characterization of companionable, universal theories
Ordinals connected with formal theories for transfinitely iterated inductive definitions
The perfect set theorem and definable wellorderings of the continuum

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528627)