Výsledky vyhledávání - "Theory of computation Logic Proof theory"

Hypersequent Calculi for Propositional Default Logics.

Autoři: Piazza, Mario Sabatini, Andrea

Zdroj: ACM Transactions on Computational Logic; Jul2025, Vol. 26 Issue 3, p1-36, 36p

Témata: PROOF theory, NONMONOTONIC logic, PROPOSITION (Logic)

Linear Logic Properly Displayed.

Autoři: GRECO, GIUSEPPE PALMIGIANO, ALESSANDRA

Zdroj: ACM Transactions on Computational Logic; Apr2023, Vol. 24 Issue 2, p1-56, 56p

Témata: LOGIC, CALCULUS

DUALIZED SIMPLE TYPE THEORY.

Autoři: EADES III, HARLEY STUMP, AARON MCCLEEARY, RYAN

Zdroj: Logical Methods in Computer Science (LMCS); 2016, Vol. 12 Issue 3, p1-47, 47p

Témata: MATHEMATICAL formulas, MATHEMATICAL logic, COMPLETENESS theorem, MATHEMATICAL analysis, MATHEMATICAL simplification

PROOF EQUIVALENCE IN MLL IS PSPACE-COMPLETE.

Autoři: HEIJLTJES, WILLEM HOUSTON, ROBIN

Zdroj: Logical Methods in Computer Science (LMCS); 2016, Vol. 12 Issue 1, p1-34, 34p

Témata: MATHEMATICAL equivalence, POLYNOMIALS, INFERENCE (Logic), PERMUTATIONS, EXPONENTIAL functions, COMPLETENESS theorem

PROOF THEORY OF A MULTI-LANE SPATIAL LOGIC.

Autoři: LINKER, SVEN HILSCHER, MARTIN

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 3, p1-27, 27p

Témata: MATHEMATICAL logic, MATHEMATICAL analysis, MATHEMATICAL functions, MATHEMATICAL models, SCIENTIFIC method

ON NESTED SEQUENTS FOR CONSTRUCTIVE MODAL LOGICS.

Autoři: ARISAKA, RYUTA DAS, ANUPAM STRASSBURGER, LUTZ

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 3, p1-33, 33p

Témata: MODAL logic, NONCLASSICAL mathematical logic, MATHEMATICAL analysis, MATHEMATICAL functions, MATHEMATICAL models

ON THE RELATIVE PROOF COMPLEXITY OF DEEP INFERENCE VIA ATOMIC FLOWS.

Autoři: DAS, ANUPAM

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 1, p1-23, 23p

Témata: MATHEMATICAL proofs, COMPUTATIONAL complexity, INFERENCE (Logic), PROPOSITIONAL calculus, POLYNOMIALS

EXTRACTING VERIFIED DECISION PROCEDURES: DPLL AND RESOLUTION.

Autoři: BERGER, ULRICH LAWRENCE, ANDREW FORSBERG, FREDRIK NORDVALL a další

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 1, p1-18, 18p

Témata: DECISION making, PROBLEM solving, MATHEMATICAL proofs, COMPUTATIONAL complexity, INFORMATION theory

THE COMPUTATIONAL COMPLEXITY OF PROPOSITIONAL CIRQUENT CALCULUS.

Autoři: BAUER, MATTHEW S.

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 1, p1-16, 16p

Témata: COMPUTATIONAL complexity, CALCULUS, PROPOSITIONAL calculus, MATHEMATICAL models, COMPUTABILITY logic

WEAK CAT-OPERADS.

Autoři: DOŠEN, KOSTA PETRIĆ, ZORAN

Zdroj: Logical Methods in Computer Science (LMCS); 2015, Vol. 11 Issue 1, p1-38, 38p

Témata: OPERADS, PARTIAL algebras, OPERATOR theory, ISOMORPHISM (Mathematics), MONOIDS

CATEGORICAL PROOF THEORY OF CO-INTUITIONISTIC LINEAR LOGIC.

Autoři: BELLIN, GIANLUIGI

Zdroj: Logical Methods in Computer Science (LMCS); 2014, Vol. 10 Issue 3, p1-36, 36p

Témata: SEMANTICS, PROOF theory, MATHEMATICAL category theory, MATHEMATICAL models, INTUITIONISTIC mathematics, MATHEMATICAL symmetry

HERBRAND-CONFLUENCE.

Autoři: HETZL, STEFAN STRASSBURGER, LUTZ

Zdroj: Logical Methods in Computer Science (LMCS); 2013, Vol. 9 Issue 4, p1-25, 25p

Témata: HERBRAND'S theorem (Number theory), SEQUENT calculus, FIRST-order logic, MATHEMATICAL forms, MATHEMATICAL proofs, SET theory

INDUCTION IN ALGEBRA: A FIRST CASE STUDY.

Autoři: SCHUSTER, PETER

Zdroj: Logical Methods in Computer Science (LMCS); 2013, Vol. 9 Issue 3, p1-19, 19p

Témata: MATHEMATICAL induction, ABSTRACT algebra, MATHEMATICAL proofs, MATHEMATICS theorems, HILBERT functions, POLYNOMIALS