scientific article; zbMATH DE number 3248792
From MaRDI portal
Publication:5537599
Cited in
(only showing first 100 items - show all)- Reducible Theories and Amalgamations of Models
- A theory of requirements capture and its applications
- scientific article; zbMATH DE number 1154174 (Why is no real title available?)
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
- scientific article; zbMATH DE number 3778514 (Why is no real title available?)
- Incomplete symbols -- definite descriptions revisited
- Minimal Covers and Hyperdegrees
- Sets Definable Over Finite Fields: Their Zeta-Functions
- On theory of regular languages with the Kleene star operation
- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
- Fuzzy inference in a formal theory of semantic equivalence
- On interpretation of inconsistent theories
- Nonstandardness and the bounded functional interpretation
- Minimal undecidable identity problem for finite-automaton mappings
- Confidentiality policies and their enforcement for controlled query evaluation
- Locally finite languages
- Complete axiomatizations of some quotient term algebras
- The structure of the models of decidable monadic theories of graphs
- Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen
- On the axiom of union
- Diem-Grade Logischer Entscheidungsprobleme
- Taking formalism seriously
- An Arithmetically Complete Predicate Modal Logic
- -languages for sets and LOGSPACE computable graph transformers
- In Praise of Numerical Computation
- Interval logics with applications to study of tense and aspect in English
- A structural operational semantics for an Edison like language. II
- Cellular objects and Shelah's singular compactness theorem
- Towards a trustworthy semantics-based language framework via proof generation
- Semantic limits of dense combinatorial objects
- scientific article; zbMATH DE number 5306054 (Why is no real title available?)
- On the desirability of mechanizing calculational proofs
- scientific article; zbMATH DE number 1953475 (Why is no real title available?)
- scientific article; zbMATH DE number 740351 (Why is no real title available?)
- Specifications, models, and implementations of data abstractions
- Crypt-equivalent algebraic specifications
- Super-exponentials nonprimitive recursive, but rudimentary
- Query evaluation in probabilistic relational databases
- Hierarchies and reducibilities on regular languages related to modulo counting
- Injecting inconsistencies into models of PA
- Arrays of prime ideals in commutative rings.
- A non-reified temporal logic
- Equivalences among various logical frameworks of partial algebras
- An inference engine for propositional two-valued logic based on the radical membership problem
- Succinct ordering and aggregation constraints in algebraic array theories
- Remarks on Herbrand normal forms and Herbrand realizations
- Recursive assertions and parallel programs
- The closure of monadic NP
- Countable algebra and set existence axioms
- The institution-theoretic scope of logic theorems
- Borel preference orders in markets with a continuum of traders
- scientific article; zbMATH DE number 3501750 (Why is no real title available?)
- Geometry on the lines of polar spine spaces
- A logical theory of robot problem solving
- One Useful Logic That Defines Its Own Truth
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- On the number of steps in proofs
- Case-free programs: An abstraction of definite horn programs
- Herbrand theorems in arbitrary institutions
- Logic in the \textit{Tractatus}
- scientific article; zbMATH DE number 4156411 (Why is no real title available?)
- Model-theoretic conservative extension for definitional theories
- Definable elements of definable Borel sets
- Super models
- Incorporating equality into logic programming via surface deduction
- Problemi di decidibilita in logica topologica
- A remark on equivalent Rosser sentences
- A herbrandized functional interpretation of classical first-order logic
- On the expressiveness of choice quantification
- Nonstandard hulls of Banach spaces
- _0-categorical stable groups
- Generalized logical consequence: Making room for induction in the logic of science
- On interpreting Chaitin's incompleteness theorem
- Some general incompleteness results for partial correctness logics
- Geometric construction by assembling solved subfigures
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Finite-model theory -- A personal perspective
- Logic, sets, and mathematics
- Fuzzy logic programming
- Random orders
- On expandability of models of Peano arithmetic. I
- Recursive assertions are not enough - or are they?
- Intuitionistic propositional logic is polynomial-space complete
- The property of being a model complete theory is preserved by Cartesian extensions
- On some formalized conservation results in arithmetic
- A game-semantic model of computation
- On partitions of \(\mathbb E^n\)
- The logic of tied implications. II. Syntax
- Toposes and intuitionistic theories of types
- Eine Formulierung des Herbrandschen Satzes ohne Skolemfunktionen
- Inductive reasoning in social choice theory
- Is mathematics problem solving or theorem proving?
- Dynamic reasoning systems
- Non-commutative first-order EQ-logics
- Domain-independent formulas and databases
- Real-valued multisets and fuzzy sets
- A functional interpretation for nonstandard arithmetic
- Complexity of Gödel’s T in λ-Formulation
- Fuzzy control from the logical point of view
- Classifying circular cellular automata
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)