EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
03-XX Mathematical logic and foundations
03Bxx General logic
03B05 Classical propositional logic

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 8 of 8

A Completness Theorem For One Class Of The Propositional Calculi

Slaviša B. Prešić (1979)

Publications de l'Institut Mathématique

A generalization of the propositional calculus for purposes of the theory of logical nets with probabilistic elements

Tomáš Havránek (1974)

Kybernetika

A lower bound for the complexity of Craig's interpolants in sentinential logic.

Daniele Mundici (1983)

Archiv für mathematische Logik und Grundlagenforschung

A measure theoretic approach to logical quantification

David P. Ellerman, Gian-Carlo Rota (1978)

Rendiconti del Seminario Matematico della Università di Padova

An application of logical-probabilistic expressions to the realization of stochastic automata

Tomáš Havránek (1974)

Kybernetika

An introduction to algorithmic logic. Metamathematical investigations in the theory of programs

L. Banachowski, A. Kreczmar, G. Mirkowska, H. Rasiowa, A. Sławicki (1977)

Banach Center Publications

An upper bound on the space complexity of random formulae in resolution

Michele Zito (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in $k$ -CNF on $n$ variables and $m = Δ n$ clauses is $O (n \cdot Δ^{- \frac{1}{k - 2}})$ .

An Upper Bound on the Space Complexity of Random Formulae in Resolution

Michele Zito (2010)

RAIRO - Theoretical Informatics and Applications

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k-CNF on n variables and m = Δn clauses is $O (n \cdot Δ^{- \frac{1}{k - 2}})$ .

Currently displaying 1 – 8 of 8

Page 1