Logical Closure Properties of Propositional Proof Systems

doi 10.1007/978-3-540-79228-4_28
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Santaraksita and Kamalasila's Logical Proof of Nihsvabhava and Dharmakirti's Logical Proof of Momentariness in His Vadanyaya

Journal of Indian and Buddhist Studies (Indogaku Bukkyogaku Kenkyu)
2013English

Expansion Nets: Proof-Nets for Propositional Classical Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Specification and Proof of Liveness Properties in B Event Systems

2007English

Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Preservative Translations Between Logical Systems

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2010English

Introduction to Logical Information Systems

Information Processing and Management
Media TechnologyInformation SystemsInformation SciencesLibraryManagement ScienceComputer Science ApplicationsOperations Research
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy