An equation-based classical logic

DOI10.1007/978-3-662-47709-0_4zbMATH Open1465.03069OpenAlexW1415925650MaRDI QIDQ2947458FDOQ2947458

Authors: Andreia Mordido, Carlos Caleiro 

Publication date: 24 September 2015

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47709-0_4

Recommendations

• Probabilistic logic over equations and domain restrictions
• Deducibility Constraints, Equational Theory and Electronic Money
• Security protocols: from linear to classical logic by abstract interpretation
• Deciding knowledge in security protocols under equational theories
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories

zbMATH Keywords

completenessdecidabilityclassical logicequational logic

Mathematics Subject Classification ID

Cryptography (94A60) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cites Work

• Probabilistic logic
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Term Rewriting and All That
• A logic for reasoning about probabilities
• Deciding knowledge in security protocols under equational theories
• A survey of symbolic methods in computational analysis of cryptographic systems
• Exogeneous semantics approach to enriching logics

Cited In (2)

• Title not available (Why is that?)
• Probabilistic logic over equations and domain restrictions

This page was built for publication: An equation-based classical logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947458)