scientific article; zbMATH DE number 3248792

Cited in

(only showing first 100 items - show all)

Injecting uniformities into Peano arithmetic
The strength of extensionality. I: Weak weak set theories with infinity
On universal transfer learning
Wittgensteinian tableaux, identity, and co-denotation
Homogeneous and strictly homogeneous criteria for partial structures
From Hilbert's program to a logic tool box
Turing oracle machines, online computing, and three displacements in computability theory
A more complete model of communicating processes
A view of computability on term algebras
Non-deterministic data types: Models and implementations
Random orders
A contribution to the theory of program testing
Countable algebra and set existence axioms
The undecidability of pseudo real closed fields
On effectively computable realizations of choice functions
A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
Computation of full logic programs using one-variable environments
A view of programming languages as symbiosis of meaning and computations
Inferences for numerical dependencies
Structured algebraic specifications: A kernel language
Incorporating equality into logic programming via surface deduction
A simple dynamic logic
Domain-independent formulas and databases
Super-exponentials nonprimitive recursive, but rudimentary
Crypt-equivalent algebraic specifications
Some results and experiments in programming techniques for propositional logic
An application of Tarski's principle to absolute Galois groups of function fields
An infinite version of Arrow's theorem in the effective setting
Some general incompleteness results for partial correctness logics
Toposes and intuitionistic theories of types
Fuzzy inference in a formal theory of semantic equivalence
On the number of steps in proofs
On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving
On interpretation of inconsistent theories
Geometric construction by assembling solved subfigures
Contribution to the study of the natural number object in elementary topoi
On partitions of \(\mathbb E^n\)
An approach for data type specification and its use in program verification
There are four countable ultrahomogeneous graphs without triangles
Hierarchical program specification and verification - a many-sorted logical approach
Recursive assertions and parallel programs
Precipitous ideals and \(\sum^1_4\) sets
Interval logics with applications to study of tense and aspect in English
Intuitionist type theory and the free topos
The reachability problem for Petri nets and decision problems for Skolem arithmetic
Arithmetical completeness in first-order dynamic logic for concurrent programs
Concrete categories and infinitary languages
Quasiidentities in a free semigroup
The equivalence of Horn and network complexity for Boolean functions
Specifications, models, and implementations of data abstractions
Difference measurement spaces
On the effective content of asymptotic verifications of Edgeworth's Conjecture
Algebraic specifiability of data types with minimal computable parameters
A non-reified temporal logic
A slight strengthening of a theorem of Blair and Kunen
Probabilistic logic programming
Logic, sets, and mathematics
A formal system of partial recursive functions
Models of arithmetic and recursive functions
When do two Banach spaces have isometrically isomorphic nonstandard hulls
The research of Jaskowski on decidability theory of first order sentences
Significato e verita nell'aritmetica peaniana
A logical theory of robot problem solving
Logic and invariant theory. IV: Invariants and syzygies in combinatorial geometry
Nonstandard hulls of Banach spaces
The polynomial-time hierarchy
Finiteness is mu-ineffable
On expandability of models of Peano arithmetic. I
_0-categorical stable groups
Borel preference orders in markets with a continuum of traders
Mechanizing \(\omega\)-order type theory through unification
Embedding and unsolvability theorems for modular lattices
On some classes of interpretations
Recursive assertions are not enough - or are they?
(A-)synchronous (non)-deterministic cell spaces simulating each other
The Boone-Higman theorem and the conjugacy problem
Problemi di decidibilita in logica topologica
Intuitionistic propositional logic is polynomial-space complete
First order logic with empty structures
On some formalized conservation results in arithmetic
On winning strategies in Ehrenfeucht-Fraïssé games
On interpreting Chaitin's incompleteness theorem
Mathematical quantum theory. I: Random ultrafilters as hidden variables
On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
A semantical framework for supporting subjective and conditional probabilities in deductive databases
On the duality of abduction and model generation in a framework for model generation with equality
A simple type theory with partial functions and subtypes
Taking formalism seriously
Left termination turned into termination
Proving partial order properties
Constructing specification morphisms
A resolution principle for constrained logics
Predictability in deterministic theories
On Jaśkowski's discussive logics
On pushout consistency, modularity and interpolation for logical specifications
A constructive valuation semantics for classical logic
Definite clause programs are canonical (over a suitable domain)
A formal specification of document processing
-languages for sets and LOGSPACE computable graph transformers
Euclidean Ramsey theorems. I

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