scientific article; zbMATH DE number 3073037
From MaRDI portal
Publication:5812175
Cited in
(only showing first 100 items - show all)- The Kleene Hierarchy Classification of Recursively Random Sequences
- ARITHMETIC MEAN BASED COMPENSATORY FUZZY LOGIC
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage
- scientific article; zbMATH DE number 7979452 (Why is no real title available?)
- Why Turing’s Thesis Is Not a Thesis
- Functorial polymorphism
- A duality for involutive bisemilattices
- Zur Theorie der konstruktiven Wohlordnungen
- Reasoning about ignorance and contradiction: many-valued logics versus epistemic logic
- Intuitionistic completeness of first-order logic
- Abstract Hilbertian deductive systems, infon logic, and Datalog
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- Computation on abstract data types. The extensional approach, with an application to streams
- An enumeration of the primitive recursive functions without repetition
- Universes of fuzzy sets and axiomatizations of fuzzy set theory. I: Model-based and axiomatic approaches
- Constructive embedding from extensions of logics of strict implication into modal logics
- On duality of logical systems: paralogics
- The undecidability of the preperfectness of Thue systems
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Type 2 recursion theory
- Prädikatenlogik mit partiell definierten Funktionen II
- Semantical analysis of weak Kleene logics
- Incomplete symbols -- definite descriptions revisited
- A note on admissible rules and the disjunction property in intermediate logics
- Trivalent logics arising from L-models for the Lambek calculus with constants
- THE TERNARY DESCRIPTION LANGUAGE AS A FORMALISM FOR THE PARAMETRIC GENERAL SYSTEMS THEORY: PART 1
- Péter on Church's thesis, constructivity and computers
- Some lattice models of bilinear logic
- On interpretation of inconsistent theories
- An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion
- Iterating both and neither: with applications to the paradoxes
- scientific article; zbMATH DE number 4168913 (Why is no real title available?)
- Pure variable inclusion logics
- Classical (co)recursion: Mechanics
- Raising awareness without disclosing truth
- About primitive recursive algorithms
- Uniform normal form for general time-bounded complexity classes
- Induction and foundation in the theory of hereditarily finite sets
- What is the Church-Turing Thesis?
- On the structure of Bochvar algebras
- On certain theorems of analysis in the formal system Kleene-Vesley
- PASCAL in LCF: Semantics and examples of proof
- Elementary Differences Between the Isols and the Co-Simple Isols
- Ackermann's model and recursive predicates
- Constructions and negationless logic
- Why post did [not] have Turing's thesis
- GP's LP
- An implementation of Kripke-Kleene semantics
- A formal theory of choreographic programming
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems
- Equivalence-preserving first-order unfold/fold transformation systems
- Anticipation and dynamics: Rosen's anticipation in the perspective of time
- Incompleteness in a topos
- On the cut operation in Gentzen calculi
- A class of implicative expansions of Kleene's strong logic, a subclass of which is shown functionally complete via the precompleteness of Łukasiewicz's 3-valued logic Ł3
- A logic for category theory
- Acquiring search-control knowledge via static analysis
- Remark on Kreisel's conjecture
- Logical foundations for programming semantics
- A reasoning method for a paraconsistent logic
- Complexity of subclasses of the intuitionistic propositional calculus
- On list primitive recursion and the complexity of computing inf
- A class of programs for which SLDNF resolution and NAF rule are complete
- Adas and the equational theory of if-then-else
- Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
- Foundations of programmology
- Metarecursively enumerable sets and admissible ordinals
- An extension of the Kreisel-Putnam system
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Some axioms for constructive analysis
- On approximate and algebraic computability over the real numbers
- Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen
- Lower bounds for increasing complexity of derivations after cut elimination
- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
- Structural cut elimination. I: Intuitionistic and classical logic
- Church’s thesis and its relation to the concept of realizability in biology and physics
- An Arithmetically Complete Predicate Modal Logic
- Generalized computations and second degree arithmetic
- Optimal fixedpoints of logic programs
- On the finitary content of Dykstra's cyclic projections algorithm
- De Morgan clones and four-valued logics
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- Consistency proof without transfinite induction for a formal system for turing machines
- Elementary realizability
- Probability, fuzziness and borderline cases
- Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic
- Semantics-to-Syntax Analyses of Algorithms
- On the desirability of mechanizing calculational proofs
- Physicalism, instrumentalism and the semantics of modal logic
- The fixed point problem of a simple reversible language
- The programming system PRIZ
- Diagonal fixed points in algebraic recursion theory
- A specialization of the form of deductions in Gentzen calculi and its applications
- Constructive operators of finite types
- Topological variants of the continuity theorem for mappings and related theorems
- The Birth of Model Checking
- Transfinite expansions of arithmetic formulas
- Equational axioms for classes of Heyting algebras
- Zur axiomatisierbarkeit von theorien in der schwachen logik der zweiten stufe
- Structure of the rational monoid algebra for Boolean matrices of order 3
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)