265 search results - page 6 / 53 » Weakly Algebraizable Logics |
124
click to vote
JOLLI
2008
15 years 4 months ago
2008
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
126
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
148
click to vote
LFCS
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
133
Voted
SGAI
2009
Springer
15 years 8 months ago
2009
Springer
PSO is a population-based technique for optimization, which simulates the social behavior of the fish schooling or bird flocking. Two significant weaknesses of this method are: fir...
154
click to vote
TYPES
2004
Springer
15 years 9 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...