scientific article; zbMATH DE number 3467028

zbMATH Open0298.02002MaRDI QIDQ4052071FDOQ4052071

Publication date: 1972

Title of this publication is not available (Why is that?)

Classical propositional logic (03B05) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)

Cited In (only showing first 100 items - show all)

On dot-depth two
Kripke semantics for higher-order type theory applied to constraint logic programming languages
A decision algorithm for linear sentences on a PFM
The data type variety of stack algebras
Compiling a default reasoning system into Prolog
Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
A satisfiability tester for non-clausal propositional calculus
Specifications, models, and implementations of data abstractions
Temporal theories as modularisation units for concurrent system specification
A methodology for using a default and abductive reasoning system
Using the Hamiltonian path operator to capture NP
A new method for undecidability proofs of first order theories
The closure of monadic NP
Title not available (Why is that?)
Fuzzy logic programming
A logic for reasoning with inconsistent knowledge
Games, equations and dot-depth two monoids
Partially-ordered (branching) generalized quantifiers: A general definition
On triangular norm-based propositional fuzzy logics
The complexity of graph connectivity
Encapsulating deontic and branching time specifications
Complete geometric query languages
Finitely representable databases
Queries with arithmetical constraints
Fuzzy temporal constraint logic: A valid resolution principle
Path constraints in semistructured databases
A mathematical framework for the semantics of symbolic languages representing periodic time
Variable declarations in natural deduction
The algebraic theory of Parikh automata
A time bound on the materialization of some recursively defined views
Some characterizations of finitely specifiable implicational dependency families
Partition semantics for relations
Reasoning about procedures as parameters in the language L4
Control problems in a temporal logic framework
A geometric interpretation of LD-resolution
The calculus of relations as a foundation for mathematics
On the computability of circumscription
Complexity and undecidability results for logic programming
Monitoring metric first-order temporal properties
Computation, hypercomputation, and physical science
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
On the proof-theory of two formalisations of modal first-order logic
Exaggeration
Learning via finitely many queries
A Note on a Theorem of Chiswell
Default reasoning by deductive planning
Compiling dyadic first-order specifications into map algebra
The knower paradox in the light of provability interpretations of modal logic
Prolog technology for default reasoning: proof theory and compilation techniques
What is the coalgebraic analogue of Birkhoff's variety theorem?
A logic and computation for Popper's conditional probabilities
Proving program inclusion using Hoare's logic
A logical study of the correspondence relation
Correspondence as an intertheory relation
Model complete universal Horn classes
Proof normalization modulo
Some questions about expressiveness and relative completeness in Hoare's logic
Inferring answers to queries
A logic for programming with complex objects
Negation by default and unstratifiable logic programs
The existence of superluminal particles is consistent with the kinematics of Einstein's special theory of relativity
Towards completeness: Husserl on theories of manifolds 1890--1901
Dealing with logical omniscience: expressiveness and pragmatics
CompoSAT: specification-guided coverage for model finding
A logical framework for default reasoning
Supersymmetry and the Möbius inversion function
Well-founded semantics for Boolean grammars
A scalable module system
Efficient theory combination via Boolean search
MV-ALGEBRA VALUED FILTER THEORY
Finite-model theory -- A personal perspective
The word and generator problems for lattices
Synonymous theories and knowledge representations in answer set programming
Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs
Order-sorted logic programming with predicate hierarchy
Frege, hilbert, and the conceptual structure of model theory
Upper and lower bounds for first order expressibility
Lexicographic probability, conditional probability, and nonstandard probability
Querying incomplete information in RDF with SPARQL
A modest logic of plurals
The logic and meaning of plurals. II
Reasoning about model accuracy
Non-commutative first-order EQ-logics
On the verification of security-aware E-services
Equivalence issues in abduction and induction
On methods for safe introduction of operations
Quantifier-free interpolation in combinations of equality interpolating theories
On observational equivalence and algebraic specification
Learning by understanding analogies
Free abelian lattice-ordered groups
Duality and rationality
Number of quantifiers is better than number of tape cells
Formalized proof systems for propositional logic
Groups, graphs, languages, automata, games and second-order monadic logic
What's so logical about the logical axioms?
Towards SMT Model Checking of Array-Based Systems
On winning strategies in Ehrenfeucht-Fraïssé games
Lax theory morphisms
Proof synthesis and reflection for linear arithmetic
On arithmetical first-order theories allowing encoding and decoding of lists

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 Q4052071)