scientific article; zbMATH DE number 3073037

Cited in

(only showing first 100 items - show all)

Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
Rough sets and 3-valued logics
From word to sentence: a pregroup analysis of the object pronoun \textit{who(m)}
Coherence in linear predicate logic
Proof systems for reasoning about computation errors
Truth values, neither-true-nor-false, and supervaluations
Two types of deflationism
Turing oracle machines, online computing, and three displacements in computability theory
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
Cut elimination for \(\mathrm{S4}_n\) and \(\mathrm{K4}_n\) with the central agent axiom
Physicalism, instrumentalism and the semantics of modal logic
On the fixpoints of nondeterministic recursive definitions
Optimal fixedpoints of logic programs
Complex structures and composite models - An essay on methodology
On effectively computable realizations of choice functions
Type 2 recursion theory
Structured algebraic specifications: A kernel language
A theory for nondeterminism, parallelism, communication, and concurrency
Uniform normal form for general time-bounded complexity classes
On superintuitionistic logics as fragments of proof logic extensions
Partial models and logic programming
Expressibility in the elementary theory of recursively enumerable sets with realizability logic
Characteristics of graph languages generated by edge replacement
Equational specification of partial higher-order algebras
Nonconstructivizability of certain ordered fields of real numbers
The programming system PRIZ
The linear abstract machine
Lower bounds on degrees of game-theoretic structures
The semantics and proof theory of linear logic
The calculus of constructions
Explanation-based generalisation \(=\) partial evaluation
Two classes of intermediate propositional logics without disjunction property
The power of temporal proofs
On the number of steps in proofs
On interpretation of inconsistent theories
Completeness proofs for propositional logic with polynomial-time connectives
Bilattices and the theory of truth
Nested recursion
Knuth's iterated powers
Partially additive categories and flow-diagram semantics
From types to sets
Formalization of equivalence of recursively defined functions
Approximability of operators in constructive metric spaces
Continuity of operators in separable constructive metric spaces
Intuitionist type theory and the free topos
A note on three-valued logic and Tarski theorem on truth definitions
Axiomatic data type specifications: A first order theory of linear lists
The independence of control structures in abstract programming systems
Remarks on recursion versus diagonalization and exponentially difficult problems
Programs and program verifications in a general setting
Unprovability of theorems of complexity theory in weak number theories
The consistency of some intuitionistic and constructive principles with a set theory
Lower bounds for increasing complexity of derivations after cut elimination
Canonical recursive functions and operations
Mixed computation: potential applications and problems for study
Hoare's logic and Peano's arithmetic
About primitive recursive algorithms
Arithmetical set theory
Three-valued nonmonotonic formalisms and semantics of logic programs
A simple fixed point characterization of three-valued stable model semantics
Effective oracles
Myhill's work in recursion theory
Map theory
A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
Modal translations in substructural logics
Constructing type systems over an operational semantics
A theory of abstraction
Equivalence-preserving first-order unfold/fold transformation systems
The \(n\)-rea enumeration degrees are dense
On arithmetic complexity of certain constructive logics
On representation of finite pseudo-Boolean algebras and one of its applications
Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
Logic, sets, and mathematics
Linearizing intuitionistic implication
Translations and structure for partial propositional calculi
On computability with functionals
Vagueness, truth and logic
Augmented loop languages and classes of computable functions
A generalization of Lyndon's theorem characterizing sentences preserved in subdirect products
Logical foundations of applied mathematics
The logical meaning of programs of a subrecursive language
Holographic or Fourier logic
Experimental tests of resolution-based theorem-proving strategies
Least fixed points revisited
Provability interpretations of modal logic
Computability concepts for programming language semantics
On the completeness of the inductive assertion method
Equational axioms for classes of Heyting algebras
Semantical analyses of propositional systems of Fitch and Nelson
Intuitionistic logic with strong negation
On certain theorems of analysis in the formal system Kleene-Vesley
PASCAL in LCF: Semantics and examples of proof
A specialization of the form of deductions in Gentzen calculi and its applications
Topological variants of the continuity theorem for mappings and related theorems
Constructive operators of finite types
Families of recursive predicates of measure zero
A propositional fragment of Lesniewski's ontology

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 Q5812175)