scientific article
From MaRDI portal
Publication:2703808
zbMath0992.03001MaRDI QIDQ2703808
Publication date: 18 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Definability in First Order Theories of Graph Orderings ⋮ Computation of new diagonal graph Ramsey numbers ⋮ DIAGONALIZATION EXHIBITED IN THE LIAR PARADOX, RUSSELL’S PARADOX AND GÖDEL’S INCOMPLETENESS THEOREM ⋮ ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC ⋮ An Impossible Asylum ⋮ Unnamed Item ⋮ Primitive recursive reverse mathematics ⋮ Reasoning about vectors: satisfiability modulo a theory of sequences ⋮ Combining stable infiniteness and (strong) politeness ⋮ Verification Modulo theories ⋮ Semantics of computable physical models ⋮ FOLASP: FO(·) as Input Language for Answer Set Solvers ⋮ On the algebraization of Henkin‐type second‐order logic ⋮ Foundations of applied mathematics. I ⋮ Missing the point in noncommutative geometry ⋮ TWO-SORTED FREGE ARITHMETIC IS NOT CONSERVATIVE ⋮ Implicit representation of relations ⋮ How (not) to construct worlds with responsibility ⋮ The Cardinal Squaring Principle and an Alternative Axiomatization of NFU ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Computational Complexity of Non-Dictatorial Aggregation ⋮ Closed testing procedures for all pairwise comparisons in a randomized block design ⋮ AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING ⋮ A menagerie of timed automata ⋮ On Hierarchical Reasoning in Combinations of Theories ⋮ Unnamed Item ⋮ A proof of completeness for continuous first-order logic ⋮ Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting ⋮ Error, consistency and triviality ⋮ Unnamed Item ⋮ The natural numbers in constructive set theory ⋮ Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Definability of Recursive Predicates in the Induced Subgraph Order ⋮ Unnamed Item ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Unnamed Item ⋮ A Roadmap to Decidability ⋮ The Connes embedding problem: A guided tour ⋮ The lazy logic of partial terms ⋮ Constructive Ackermann's interpretation ⋮ Increasing sentences in simple type theory ⋮ Metamathematical investigations on the theory of grossone ⋮ Modular semantics for theories: an approach to paraconsistent reasoning ⋮ Probabilistic modelling, inference and learning using logical theories ⋮ Some remarks on real numbers induced by first-order spectra ⋮ Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries ⋮ Decidability of general extensional mereology ⋮ Fuzzy constructive logic ⋮ Satisfiability Modulo Theories ⋮ Proof-theory and semantics for a theory of definite descriptions ⋮ Positive Formulas in Intuitionistic and Minimal Logic ⋮ Unnamed Item ⋮ MEBN: a language for first-order Bayesian knowledge bases ⋮ RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES ⋮ A defeasible reasoning model of inductive concept learning from examples and communication ⋮ On the universality of atomic and molecular logics via protologics ⋮ Extension and interpretability ⋮ Unnamed Item ⋮ A formalist philosophy of mathematics. I: Arithmetic ⋮ Curves in Gödel-space: towards a structuralist ontology of mathematical signs ⋮ Action Theories over Generalized Databases with Equality Constraints ⋮ Algebraic data integration ⋮ LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC ⋮ A comprehensive picture of the decidability of mereological theories ⋮ Observing, reporting, and deciding in networks of sentences ⋮ The never-ending recursion ⋮ On local domain symmetry for model expansion ⋮ Decidability of logics based on an indeterministic metric tense logic ⋮ A study of the neutrality of Boolean function landscapes in genetic programming ⋮ Decidable cases of first-order temporal logic with functions ⋮ Keeping logic in the trivium of computer science: a teaching perspective ⋮ Bases for structures and theories. I. ⋮ Categorical foundations for structured specifications in \(\mathsf{Z}\) ⋮ The adverbial theory of numbers: some clarifications ⋮ Logic and ontological pluralism ⋮ Decision procedures for term algebras with integer constraints ⋮ The enhanced indispensability argument, the circularity problem, and the interpretability strategy ⋮ Craig interpolation for networks of sentences ⋮ First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ SPECIFICATION AND COMPUTING STATES IN FUZZY ALGORITHMS ⋮ The non-unique universe ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ \(\epsilon\)-semantics computations on biological systems ⋮ More on Systems of Truth and Predicative Comprehension ⋮ An extension of lazy abstraction with interpolation for programs with arrays ⋮ Enhancing Symbolic Execution of Heap-Based Programs with Separation Logic for Test Input Generation ⋮ Cathoristic Logic ⋮ Quantifiers Are Logical Constants, but Only Ambiguously ⋮ Carnap's early semantics ⋮ Expressive power and abstraction in Essence ⋮ A framework for step-wise explaining how to solve constraint satisfaction problems ⋮ Estimation of the dimensions of some Kisin varieties ⋮ Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior ⋮ Scalable offline monitoring of temporal specifications ⋮ Many-sorted equivalence of shiny and strongly polite theories
This page was built for publication:
