Systems of linear Boolean equations.
S. Rudeanu (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
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.
Displaying similar documents to “On Probability Function On Pseudo-Boolean Algebra”
Systems of linear Boolean equations.
On the range of a Boolean transformation.
S. Rudeanu (1975)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
A pseudo-Boolean viewpoint on systems of representatives
P. L. Ivănescu, S. Rudeanu (1969)
Applicationes Mathematicae
Similarity:
On reproductive solutions of arbitrary equations.
S. Rudeanu (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Rigid Boolean Algebras
Stevo Todorčević (1979)
Publications de l'Institut Mathématique
Similarity:
Very strongly rigid Boolean algebras.
S. Todorcevic (1980)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Saturated Boolean algebras with ultrafilters.
Z. Mijajlovic (1979)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
On A Random Function Defined On A Pseudo Boolean Algebra
Jelena Bulatović (1982)
Publications de l'Institut Mathématique
Similarity:
Characterization of a full set of probabilities on some posets.
Gill, J.B. (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
An axiomatoc approach to pseudo-boolean programming. I
S. Rudeanu (1970)
Matematički Vesnik
Similarity:
A linear pseudo-Boolean viewpoint on matching and other central concepts in graph theory
J. Nieminen (1974)
Applicationes Mathematicae
Similarity:
On pseudo metric semi-symmetric connections.
M. Prvanovic (1974)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Didactical note: probabilistic conditionality in a Boolean algebra.
Enric Trillas, Claudi Alsina, Settimo Termini (1996)
Mathware and Soft Computing
Similarity:
This note deals with two logical topics and concerns Boolean Algebras from an elementary point of view. First we consider the class of operations on a Boolean Algebra that can be used for modelling If-then propositions. These operations, or Conditionals, are characterized under the hypothesis that they only obey to the Modus Ponens-Inequality, and it is shown that only six of them are boolean two-place functions. Is the Conditional Probability the Probability of a Conditional? This problem...