scientific article; zbMATH DE number 3304881
From MaRDI portal
Publication:5586197
zbMath0192.01901MaRDI QIDQ5586197
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
An axiomatic explanation of complete self-reproduction ⋮ Gödel's incompleteness theorem ⋮ Recursive categoricity and recursive stability ⋮ On a generalized iteration method with applications to fixed point theorems and elliptic systems involving discontinuities ⋮ Succinct definitions in the first order theory of graphs ⋮ On some generalizations of the primitive recursive arithmetic ⋮ An extension of the stable semantics via Lukasiewicz logic ⋮ On the complexity of theories of permutations ⋮ Limited reasoning in first-order knowledge bases ⋮ Domain-independent formulas and databases ⋮ A qualitative fuzzy possibilistic logic ⋮ The Qu-Prolog unification algorithm: formalisation and correctness ⋮ The syntax of nonstandard analysis ⋮ Type data bases with incomplete information ⋮ Bayesian estimation and the Kalman filter ⋮ Invariance under stuttering in a temporal logic of actions ⋮ Ackermann functions and transfinite ordinals ⋮ On a synonymy relation for extensional first order theories. I: A notion of synonymy ⋮ Ganzgeschlossene und prädikatengeschlossene Logiken I ⋮ On interpretation of inconsistent theories ⋮ A formalization of measurement scale forms ⋮ NUMBER SYSTEMS WITH SIMPLICITY HIERARCHIES: A GENERALIZATION OF CONWAY’S THEORY OF SURREAL NUMBERS II ⋮ The lack-of-preference law and the corresponding distributions in frequency probability theory ⋮ A theory of implementation and refinement in timed Petri nets ⋮ An observationally complete program logic for imperative higher-order functions ⋮ Monadic logic programs and functional complexity ⋮ Indexical knowledge and robot action -- a logical account ⋮ The interpreted type-free modal calculus MC\(^\infty\). I: The type free extensional calculus EC\(^\infty\) involving individuals, and the interpreted language ML\(^\infty\) on which MC\(\infty\) is based ⋮ Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic ⋮ Non-monotonic logic. I ⋮ Classical logic is not uniquely characterizable ⋮ Generalized fuzzy set systems and particularization ⋮ Languages of logic and their applications ⋮ THREE DIFFERENT FORMALISATIONS OF EINSTEIN’S RELATIVITY PRINCIPLE ⋮ Intuitionist type theory and the free topos ⋮ On fuzzification of Tarski's fixed point theorem without transitivity ⋮ Intuitionistic fuzzy interpretations of Barcan formulas ⋮ Categorical pairs and the indicative shift ⋮ Difference measurement spaces ⋮ Contributions to foundations of probability calculus on the basis of the modal logical calculus MC(nu) or MC*(nu) ⋮ Learning with belief levels ⋮ On two complete sets in the analytical and the arithmetical hierarchies ⋮ The nature of the extended analog computer ⋮ A reconstruction and extension of Maple's assume facility via constraint contextual rewriting ⋮ Plausible reasoning: a first-order approach ⋮ Computational complexity of sentences over fields ⋮ Local theory of sets as a foundation for category theory and its connection with the Zermelo-Fraenkel set theory ⋮ Petri nets and bisimulation ⋮ AEPL: An extensible programming language† ⋮ Map theory ⋮ Unnamed Item ⋮ Agenda control for heterogeneous reasoners ⋮ YinYang bipolar logic and bipolar fuzzy logic ⋮ The interpreted type-free modal calculus \(MC^\infty\). III: Ordinals and cardinals im \(MC^\infty\) ⋮ Associative processors as a tool for maximal parallelism ⋮ Holographic or Fourier logic ⋮ A new approach to the symbolic factorization of multivariate polynomials ⋮ Safe beliefs for propositional theories ⋮ Referential logic of proofs ⋮ Axioms for a theory of semantic equivalence ⋮ A logical framework for depiction and image interpretation ⋮ Consistency property and model existence theorem for second order negative languages with conjunctions and quantifications over sets of cardinality smaller than a strong limit cardinal of denumerable cofinality ⋮ The elimination of descriptions from A. Bressan's modal language \(ML^\nu\) on which the logical calculus \(MC^\nu\) is based ⋮ The neglect of epistemic considerations in logic: the case of epistemic assumptions ⋮ Categorical invariance and structural complexity in human concept learning ⋮ A comparative study of Tarski's fixed point theorems with the stress on commutative sets of \(\mathbf{L}\)-fuzzy isotone maps with respect to transitivities ⋮ Invariance to ordinal transformations in rank-aware databases ⋮ On paraconsistent extensions of \(C_1\) ⋮ Recursive query processing: The power of logic ⋮ The category of complete lattices as a category of algebras ⋮ Rough mereology: A new paradigm for approximate reasoning ⋮ A logic for reasoning about probabilities ⋮ Data types over multiple-valued logics ⋮ Acerca de la teoría de los números transfinitos de Cantor, de 1874 a 1940 ⋮ Sentient arithmetic and Gödel's theorems ⋮ Consistency proof without transfinite induction for a formal system for turing machines ⋮ The foundations of the logic ofN-tuples ⋮ The semantics of induction and the possibility of complete systems of inductive inference ⋮ What robots can do: robot programs and effective achievability ⋮ Syntactical treatments of propositional attitudes ⋮ Groups of order-automorphisms of the rationals with prescribed scale type ⋮ Hypothesis generation by machine ⋮ \(\aleph_0\)-categoricity of groups ⋮ From memories to inductively derived views: a constructive approach ⋮ Elements of intuitionistic fuzzy logic. I ⋮ Remark on the intuitionistic fuzzy logics ⋮ Categoricity ⋮ A family of genuine and non-algebraisable C-systems ⋮ A data structure formalization through generating function ⋮ The interpreted type-free modal calculus MC\(^\infty\). II: Foundations of MC\(^\infty\) ⋮ Contributions to foundations of probability calculus on the basis of the modal logical calculus \(MC^{\nu}\) or \(MC_*\!^{\nu}.III:\) An analysis of the notions of random variables and probability spaces, based on modal logic ⋮ On a synonymy relation for extensional first order theories. II: A sufficient criterion for non synonymy. Applications ⋮ Do I know \(\Omega \)? An I iomatic model of awareness and knowledge ⋮ On a synonymy relation for extensional first order theories. III: A necessary and sufficient condition for synonymy ⋮ Plausible inferences and plausible reasoning ⋮ A RESONANCE MODEL OF LOGIC ⋮ On axiom systems of propositional calculi, IV ⋮ Complex structures and composite models - An essay on methodology ⋮ Propositional calculus under adjointness ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
This page was built for publication:
