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)
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 ⋮ Verification of population protocols ⋮ Orbital integrals are motivic ⋮ Characterising nested database dependencies by fragments of propositional logic ⋮ Elements for a formal model of intentional systems ⋮ Extended fuzzy constructive logic ⋮ Confusion of memory ⋮ Quantum value indefiniteness ⋮ Logical geometries and information in the square of oppositions ⋮ The diagonalization method in quantum recursion theory ⋮ Formal specification and verification of dynamic parametrized architectures ⋮ Characterizing unambiguous precedence systems in expressions without superfluous parentheses ⋮ Reflexive intermediate propositional logics ⋮ Inclusion dynamics hybrid automata ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ A logic of plausible justifications ⋮ On solving quantified bit-vector constraints using invertibility conditions ⋮ The implicit commitment of arithmetical theories and its semantic core ⋮ Towards satisfiability modulo parametric bit-vectors ⋮ On Interpolation and Symbol Elimination in Theory Extensions ⋮ Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams ⋮ Politeness and stable infiniteness: stronger together ⋮ Towards bit-width-independent proofs in SMT solvers ⋮ Don't care words with an application to the automata-based approach for real addition ⋮ Model theory of adeles. I. ⋮ Decidability questions for a ring of Laurent polynomials ⋮ Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics ⋮ \(k\)-provability in \(\mathrm{PA}\) ⋮ On decidability and axiomatizability of some ordered structures ⋮ Valuation semantics for first-order logics of evidence and truth ⋮ Axiomatic (and non-axiomatic) mathematics ⋮ First-order logics of evidence and truth with constant and variable domains ⋮ Polite combination of algebraic datatypes ⋮ Scalable algorithms for abduction via enumerative syntax-guided synthesis ⋮ A decision procedure for string to code point conversion ⋮ Politeness for the theory of algebraic datatypes ⋮ Flexible proof production in an industrial-strength SMT solver ⋮ Reasoning about vectors using an SMT theory of sequences ⋮ A logical foundation of arithmetic ⋮ Types of I-free hereditary right maximal terms ⋮ On the decidability of axiomatized mereotopological theories ⋮ A note on typed truth and consistency assertions ⋮ Relational semantics for Kleene logic and action logic
This page was built for publication:
