TRANSITIVE PRIMAL INFON LOGIC (Q4928774)

From MaRDI portal

Revision as of 08:29, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: TRANSITIVE PRIMAL INFON LOGIC

scientific article; zbMATH DE number 6176643

Language	Label	Description	Also known as
English	TRANSITIVE PRIMAL INFON LOGIC	scientific article; zbMATH DE number 6176643

Statements

scholarly article

0 references

TRANSITIVE PRIMAL INFON LOGIC (English)

0 references

0 references

0 references

The Review of Symbolic Logic

0 references

publication date

18 June 2013

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Many-dimensional modal logics: theory and applications

0 references

Linear-time algorithms for testing the satisfiability of propositional horn formulae

0 references

Complexity of subclasses of the intuitionistic propositional calculus

0 references

LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation

0 references

The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

0 references

full work available at URL

https://doi.org/10.1017/s1755020312000366

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S1755020312000366

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4928774

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4928774&oldid=36889815"