Sage Journals: Discover world-class research

Retricted access

Research article

First published 2007-9

A Propositional Proof System with Quantification Over Permutations

Grzegorz Herman, Tim Paterson, Michael Soltys

Fundamenta Informaticae

Open access

Research article

First published 2010-2

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity 1 2

Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov [...]

Journal on Satisfiability,Boolean Modelling and Computation

Retricted access

Research article

First published 2007-9

Optimal Proof Systems,Optimal Acceptors and Recursive Presentability

Zenon Sadowski

Fundamenta Informaticae

Retricted access

Research article

First published 2013-4

Gödel Homomorphisms as Gödel Modal Operators

Oliver Fasching

Fundamenta Informaticae

Retricted access

Research article

First published 1995-7

METAMATHEMATICS OF CONTEXTS

Saša Buvač, Vanja Buvač, Ian A. Mason

Fundamenta Informaticae

Retricted access

Research article

First published 1990

Resolution in the Domain of Strongly Finite Logics

Zbigniew Stachniak, Peter O’Hearn

Fundamenta Informaticae

Free access

Research article

First published 2024-1

A missing piece in the debate about naked statistical evidence

Alejo Joaquín Giles

The International Journal of Evidence & Proof

Free access

Research article

First published 2010-8

An Expansion of the Neural Network Theory by Introducing Hebb Postulate

Algis Garliauskas

Informatica: An International Journal of Computing and Informatics

Retricted access

Research article

First published 2008-7-16

Preprocessing for controlled query evaluation with availability policy *

Joachim Biskup, Lena Wiese

Journal of Computer Security

Retricted access

Research article

First published 2008-2

Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Mark-Oliver Stehr

Fundamenta Informaticae

Search results