scientific article

zbMath0298.02002MaRDI QIDQ4052071

H. B. Enderton

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items (only showing first 100 items - show all)

Querying incomplete information in RDF with SPARQL ⋮ Equivalence issues in abduction and induction ⋮ Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules ⋮ On methods for safe introduction of operations ⋮ On observational equivalence and algebraic specification ⋮ Well-founded semantics for Boolean grammars ⋮ Lexicographic probability, conditional probability, and nonstandard probability ⋮ Multi-layer logic - a predicate logic including data structure as knowledge representation language ⋮ On the computability of circumscription ⋮ Learning by understanding analogies ⋮ A logical framework for default reasoning ⋮ The word and generator problems for lattices ⋮ Variable declarations in natural deduction ⋮ A mathematical framework for the semantics of symbolic languages representing periodic time ⋮ A satisfiability tester for non-clausal propositional calculus ⋮ A geometric interpretation of LD-resolution ⋮ Duality and rationality ⋮ Minimalism, justification and non-monotonicity in deductive databases ⋮ First-order logic formalisation of impossibility theorems in preference aggregation ⋮ The calculus of relations as a foundation for mathematics ⋮ A rough logic formalism for fuzzy controllers: A hard and soft computing view ⋮ A logic road from special relativity to general relativity ⋮ A theory of implementation and refinement in timed Petri nets ⋮ A logical expression of reasoning ⋮ Towards completeness: Husserl on theories of manifolds 1890--1901 ⋮ A scalable module system ⋮ Effective computation of immersion obstructions for unions of graph classes ⋮ On the proof-theory of two formalisations of modal first-order logic ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ Quantifiers as modal operators ⋮ On the verification of security-aware E-services ⋮ Axiomatic data type specifications: A first order theory of linear lists ⋮ Branching versus linear logics yet again ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Specifications, models, and implementations of data abstractions ⋮ Number of quantifiers is better than number of tape cells ⋮ Inferring answers to queries ⋮ Upper and lower bounds for first order expressibility ⋮ The existence of superluminal particles is consistent with relativistic dynamics ⋮ Minimal change: relevance and recovery revisited ⋮ An analysis of fixed-point queries on binary trees ⋮ Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields ⋮ On a generalization of the Gallai-Sylvester theorem ⋮ Proof synthesis and reflection for linear arithmetic ⋮ Algebraic logic for classical conjunction and disjunction ⋮ Partially-ordered (branching) generalized quantifiers: A general definition ⋮ On the role of language in social choice theory ⋮ Temporal theories as modularisation units for concurrent system specification ⋮ Game show shenanigans: Monty Hall meets mathematical logic ⋮ Semantics and reasoning with free procedures ⋮ Partial monotonicity and a new version of the Ramsey test ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ On the complexity of propositional and relational credal networks ⋮ A decision algorithm for linear sentences on a PFM ⋮ Using the Hamiltonian path operator to capture NP ⋮ A logic for programming with complex objects ⋮ Reasoning about model accuracy ⋮ A logic for reasoning with inconsistent knowledge ⋮ Games, equations and dot-depth two monoids ⋮ Computation, hypercomputation, and physical science ⋮ A logic for reasoning with inconsistency ⋮ Finite-model theory -- A personal perspective ⋮ Completing sort hierarchies ⋮ The logic of constraint satisfaction ⋮ A nonstandard characterization of sequential equilibrium, perfect equilibrium, and proper equilibrium ⋮ A new method for undecidability proofs of first order theories ⋮ Dealing with logical omniscience: expressiveness and pragmatics ⋮ Rational choice and polynomial measurement models ⋮ Free abelian lattice-ordered groups ⋮ Linear quantifier elimination ⋮ Encapsulating deontic and branching time specifications ⋮ The set of realizations of a max-plus linear sequence is semi-polyhedral ⋮ Some characterizations of finitely specifiable implicational dependency families ⋮ A time bound on the materialization of some recursively defined views ⋮ Partition semantics for relations ⋮ Supersymmetry and the Möbius inversion function ⋮ Reasoning about procedures as parameters in the language L4 ⋮ The algebraic theory of Parikh automata ⋮ Learning symmetric causal independence models ⋮ Compiling a default reasoning system into Prolog ⋮ Negation in rule-based database languages: A survey ⋮ Negation by default and unstratifiable logic programs ⋮ On winning strategies in Ehrenfeucht-Fraïssé games ⋮ Exaggeration ⋮ An analysis of first-order logics of probability ⋮ Reasoning about knowledge of unawareness ⋮ Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis ⋮ Combination of convex theories: modularity, deduction completeness, and explanation ⋮ Proving program inclusion using Hoare's logic ⋮ Average case optimality for linear problems ⋮ A logical study of the correspondence relation ⋮ What's so logical about the logical axioms? ⋮ Correspondence as an intertheory relation ⋮ Model complete universal Horn classes ⋮ Are mathematical theorems analytic or synthetic? ⋮ Some questions about expressiveness and relative completeness in Hoare's logic ⋮ The logic and meaning of plurals. I ⋮ Learning via finitely many queries ⋮ A note on Presburger arithmetic with array segments, permutation and equality ⋮ Order-sorted logic programming with predicate hierarchy

This page was built for publication: