

Computational Logic and Proof Theory -
- Format: Broché
- 372 pages Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtre36,33 €
Produit Neuf
Ou 9,08 € /mois
- Livraison à 0,01 €
- Livré entre le 4 et le 7 août
Nos autres offres
-
88,35 €
Produit Neuf
Ou 22,09 € /mois
- Livraison : 25,00 €
- Livré entre le 8 et le 13 août
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour

Avis sur Computational Logic And Proof Theory de Collectif Format Broché - Livre
0 avis sur Computational Logic And Proof Theory de Collectif Format Broché - Livre
Donnez votre avis et cumulez 5
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
Présentation Computational Logic And Proof Theory de Collectif Format Broché
- LivreAuteur(s) : CollectifEditeur : Springer-Verlag GmbhLangue : AnglaisParution : 01/08/1993Nombre de pages : 372Expédition : 499Dimensions : 23.5 x 15.5 x 1.9 Résumé :The...
Résumé :
The Third Kurt G
Sommaire:
The mathematics of set predicates in Prolog.- Some connections between set theory and computer science.- G?del's Dialectica interpretation and its two-way stretch.- Epistemic entrenchment and arithmetical hierarchy (abstract).- A critical reexamination of default logic, autoepistemic logic, and only knowing.- Complexity issues in nonmonotonic logic and logic programming (abstract).- Strategies for resolution method in non-classical logics (Abstract).- Undecidability of implication problems in logic programming, database theory and classical logic.- Building up a tool-box for Martin-L?f's type theory (abstract).- The logic of the G?del proof predicate.- Superposition with simplification as a decision procedure for the monadic class with equality.- Computation with access to the reals, but using only classical machines.- The even more liberalized ?-rule in free variable Semantic Tableaux.- Differentiating assumptions from extra-logical axioms in natural deduction.- The inverse of fitting's functional.- On loop detection in connection calculi.- On Arnol'd's Hilbert symposium problems.- The structure of exponentials: Uncovering the dynamics of linear logic proofs.- On different concepts of function introduction.- Double exponential inseparability of Robinson subsystem Q+ from the unsatisfiable sentences in the language of addition.- On the meaning of essentially unprovable theorems in the presburger theory of addition.- A syntactic consistency proof for NaDSet.- A rule-based algorithm for rigid E-unification.- A scheme for weakened negative introspection in autoepistemic reasoning.- On the weakness of sharply bounded polynomial induction.- On the logic of hypergraphs.- Recursion theoretic properties of frequency computation and bounded queries (extended abstract).-Interpreting true arithmetic in degree structures.- Classical proofs as programs.- Completeness of the pool calculus with an open built-in theory.- On the saturation principle for a linear temporal logic.- A construction of typed lambda models related to feasible computability.- Nonmonotonic reasoning is sometimes simpler.- Self-verifying axiom systems.- Committed-choice concurrent logic programming in linear logic.
Détails de conformité du produit
Personne responsable dans l'UE