Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
subformula property
Description:
A structural property of logical calculi stating that proofs of a formula use only subformulas of that formula.
Primary topic:
Advanced Algebra and Logic (32%)
Related topics:
Advanced Algebra and Logic (32%),
Logic, Reasoning, and Knowledge (32%),
Logic, programming, and type systems (29%)
OpenAlex ID:
keywords/subformula-property
Contraction-free sequent calculi for intuitionistic logic
1992
·
Roy Dyckhoff
·
Journal of Symbolic Logic
·
339
Deep sequent systems for modal logic
2009
·
Kai Brünnler
·
Archive for Mathematical Logic
·
227
On the unity of logic
1993
·
Jean-Yves Girard
·
Annals of Pure and Applied Logic
·
220
PDF
Canonical Propositional Gentzen-Type Systems
2001
·
Arnon Avron
, Iddo Lev
·
Lecture notes in computer science
·
136
Non-commutativity and MELL in the Calculus of Structures
2001
·
Alessio Guglielmi
, Lutz Straßburger
·
Lecture notes in computer science
·
125
Modal Tableaux with Propagation Rules and Structural Rules
1997
·
Marcos A. Castilho
, Luis Fariñas del Cerro
, et al.
·
Fundamenta Informaticae
·
65
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
2011
·
Rajeev Gore
, Linda Postniece
, et al.
·
Logical Methods in Computer Science
·
59
PDF
Automated complexity analysis based on ordered resolution
2001
·
David Basin
, Harald Ganzinger
·
Journal of the ACM
·
59
Some remarks on lengths of propositional proofs
1995
·
Samuel R. Buss
·
Archive for Mathematical Logic
·
58
Cut-free sequent systems for temporal logic
2008
·
Kai Brünnler
, Martin Lange
·
The Journal of Logic and Algebraic Programming
·
55
PDF
A Multi-type Calculus for Inquisitive Logic
2016
·
Sabine Frittella
, Giuseppe Greco
, et al.
·
Lecture notes in computer science
·
51
From Basic Logic to Quantum Logics with Cut-Elimination
1998
·
Claudia Faggian
, Giovanni Sambin
·
International Journal of Theoretical Physics
·
47
Proofs, search and computation in general logic
1990
·
David Pym
·
ERA
·
46
PDF
Multi-type display calculus for propositional dynamic logic
2014
·
Sabine Frittella
, Giuseppe Greco
, et al.
·
Journal of Logic and Computation
·
43
PDF
Analytic Cut and Interpolation for Bi-intuitionistic Logic
2016
·
TOMASZ KOWALSKI
, HIROAKIRA ONO
·
The Review of Symbolic Logic
·
42
Existential instantiation and normalization in sequent natural deduction
1992
·
Carlo Cellucci
·
Annals of Pure and Applied Logic
·
42
PDF
Gentzen's Proof Systems: Byproducts in a Work of Genius
2012
·
Jan von Plato
·
Bulletin of Symbolic Logic
·
41
A cut-free Gentzen formulation of the modal logic S5
2000
·
T Brauner
·
Logic Journal of IGPL
·
40
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models
2012
·
Mauro Ferrari
, Camillo Fiorentini
, et al.
·
Journal of Automated Reasoning
·
39
Strong Normalization of Classical Natural Deduction with Disjunction
2001
·
Philippe de Groote
·
Lecture notes in computer science
·
37
Classical Gentzen-type Methods in Propositional Many-valued Logics
2003
·
Arnon Avron
·
Studies in fuzziness and soft computing
·
35
Cut-free sequent and tableau systems for propositional Diodorean modal logics
1994
·
Rajeev Gor�
·
Studia Logica
·
35
Complexity analysis based on ordered resolution
2002
·
D. Basin
, H. Ganzinger
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
33
Sequent calculus in natural deduction style
2001
·
Sara Negri
, Jan von Plato
·
Journal of Symbolic Logic
·
32
The Logic of Resources and Capabilities
2018
·
MARTA BÍLKOVÁ
, GIUSEPPE GRECO
, et al.
·
The Review of Symbolic Logic
·
31
PDF
Show more works
View as search
Works count:
273
Citation count:
3,398
Year
Topic
Type